Computer and information sciences topic list of research papers
-
Research and Analysis of Image Processing Technologies Based on DotNet Framework
Abstract Microsoft.Net is a kind of most popular program development tool. This paper gave a detailed analysis concluded about some image processing technologies of the advantages and disadvantages by .Net processed image while the same algorithm is ...
2012 / Song Ya-Lin, Bai Chen-Xi -
A general map matching algorithm for transport telematics applications2003 / Mohammed A. Quddus, Washington Yotto Ochieng, Lin Zhao, Robert B. Noland
-
Model Transformation From VisualOCL to OCL Using Graph Transformation
Abstract In this paper we present a model transformation from a visual representation (VisualOCL) of the Object Constraint Language (OCL) to the textual one using graph transformation. Starting from VisualOCL diagrams, we show how their underlying...
2006 / Karsten Ehrig, Jessica Winkelmann -
Verifying Object-Based Graph Grammars
Abstract Object-Based Graph Grammars (OBGG) is a formal language suitable for the specification of distributed systems. On previous work, a translation from OBGG models to PROMELA (the input language of the SPIN model checker) was defined, enabling...
2004 / Osmar Marchi dos Santos, Fernando Luís Dotti, Leila Ribeiro -
Epistemic Verification of Anonymity
Abstract Anonymity is not a trace-based property, therefore traditional model checkers are not directly able to express it and verify it. However, by using epistemic logic (logic of knowledge) to model the protocols, anonymity becomes an easily...
2007 / Jan van Eijck, Simona Orzan -
Improved Distributed Algorithms for SCC Decomposition
Abstract We study and improve the OBF technique [Barnat, J. and P.Moravec, Parallel algorithms for finding SCCs in implicitly given graphs, in: Proceedings of the 5th International Workshop on Parallel and Distributed Methods in Verification (PDMC...
2008 / Jiří Barnat, Jakub Chaloupka, Jaco van de Pol -
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
Abstract In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many novel algorithmic techniques have been proposed. In this...
2007 / Camil Demetrescu, Giuseppe F. Italiano -
Realizability for Monotone and Clausular (Co)inductive Definitions
Abstract We develop an extension of second order logic (AF2) with monotone, and not only positive, (co)inductive definitions and a clausular feature which simplifies considerably the defining mechanism. A sound realizability interpretation, where...
2005 / Favio E. Miranda-Perea -
Model Checking Quantitative Linear Time Logic
Abstract This paper considers QLtl, a quantitative analagon of Ltl and presents algorithms for model checking QLtl over quantitative versions of Kripke structures and Markov chains.
2008 / Marco Faella, Axel Legay, Mariëlle Stoelinga -
Process Algebra with Hooks for Models of Pattern Formation
Abstract We introduce Process Algebra with Hooks (PAH). In PAH processes represent different layers of abstraction, from biochemistry to tissue, and special synchronisations via hook actions ensure consistency between these abstractions. There is an ...
2010 / Andrea Degasperi, Muffy Calder -
A Rewrite Framework for Language Definitions and for Generation of Efficient Interpreters
Abstract A rewrite logic semantic definitional framework for programming languages is introduced, called K, together with partially automated translations of K language definitions into rewriting logic and into C. The framework is exemplified by...
2007 / Mark Hills, Traian Şerbănuţă, Grigore Roşu -
Combining OCL and Programming Languages for UML Model Processing2004 / Mika Siikarla, Jari Peltonen, Petri Selonen
-
Pervasive Compiler Verification – From Verified Programs to Verified Systems
Abstract We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pervasive system verification and allows to transfer...
2008 / Dirk Leinenbach, Elena Petrova -
Preface2008 / Alessandro Aldini, Christel Baier
-
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
Abstract We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first proof of its kind to be wholly machine checked. Although the...
2007 / Jesper Bengtson, Joachim Parrow -
Active Evaluation Contexts for Reaction Semantics
Abstract In the context of process algebras it is customary to define semantics in the form of a reaction relation supported by a structural congruence relation. Recently process algebras have grown more expressive in order to meet the modelling...
2007 / Henrik Pilegaard, Flemming Nielson, Hanne Riis Nielson -
Correct Microkernel Primitives
Abstract Primitives are basic means provided by a microkernel to implementors of operating system services. Intensively used within every OS and commonly implemented in a mixture of high-level and assembly programming languages, primitives are...
2008 / Artem Starostin, Alexandra Tsyban -
On the Expressive Power of Klaim-based Calculi
Abstract In this work, we study the expressive power of variants of Klaim, an experimental language with programming primitives for global computing that combines the process algebra approach with the coordination-oriented one. Klaim has proved to...
2005 / Rocco De Nicola, Daniele Gorla, Rosario Pugliese -
The Compositional Method and Regular Reachability
Abstract The compositional method, introduced by Feferman and Vaught in 1959, allows to reduce the model-checking problem for a product structure to the model-checking problem for its factors. It applies to first-order logic, and limitations for its ...
2008 / Ingo Felscher -
Relating Hybrid Chi to Other Formalisms
Abstract The hybrid χ (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. It integrates concepts from dynamics and control theory with concepts from computer science, in particular from process algebra and hybrid...
2007 / D.A. van Beek, J.E. Rooda, R.R.H. Schiffelers, K.L. Man, M.A. Reniers