Computer and information sciences topic list of research papers
-
CVM – A Verified Framework for Microkernel Programmers
Abstract CVM (communicating virtual machines) is a computational model for concurrent user processes interacting with a generic microkernel—supporting virtual memory—and devices. In this paper, we introduce the computational models needed to define...
2008 / Tom In der Rieden, Alexandra Tsyban -
Safety-Oriented Design of Component Assemblies using Safety Interfaces
Abstract This paper promotes compositional reasoning in the context of safety-critical systems, and demonstrates a safety-oriented component model using an application from the automotive industry: an Adaptive Cruise Controller (ACC). The...
2007 / Jonas Elmqvist, Simin Nadjm-Tehrani -
System BV is NP-complete
Abstract System BV is an extension of multiplicative linear logic (MLL) with the rules mix, nullary mix, and a self-dual, non-commutative logical operator, called seq. While the rules mix and nullary mix extend the deductive system, the operator seq ...
2005 / Ozan Kahramanoğulları -
Prototyping SOS Meta-theory in Maude
Abstract We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formulae, deduction rules and transition system specifications) in...
2006 / Mohammad Reza Mousavi, Michel A. Reniers -
On Validity Assurance of Dynamic Reconfiguration for Component-based Programs
Abstract Growing the need for long-life and high-available programs, dynamic reconfiguration is going to be an important research issue. Dynamic reconfiguration enables the software systems to change at runtime to decrease their down-time in case of ...
2006 / Mahdi Niamanesh, Nafiseh Fekrazad Nobakht, Rasool Jalili, Faranak Heydarian Dehkordi -
Strategic Rewriting
Abstract This is a position paper preparing the round table organized during the 4th International Workshop on Reduction Strategies in Rewriting and Programming. I sketch what I believe to be important challenges of strategic rewriting. ...
2005 / Claude Kirchner -
Branching-Time Model-Checking of Probabilistic Pushdown Automata
Abstract In this paper we study complexity of the model-checking problem for probabilistic pushdown automata (pPDA) and qualitative fragments of two branching-time logics PCTL* and PECTL*. We prove tha this problem is in 2-EXPTIME for pPDA and...
2009 / Tomáš Brázdil, Václav Brožek, Vojtěch Forejt -
Towards a Calculus For Wireless Systems
Abstract In wireless systems, the communication mechanism combines features of broadcast, synchrony, and asynchrony. We develop an operational semantics for a calculus of wireless systems. We present a Reduction Semantics and a Labelled Transition...
2006 / Nicola Mezzetti, Davide Sangiorgi -
Development Separation in Lambda-Calculus
Abstract We present a proof technique in λ-calculus that can facilitate inductive reasoning on λ-terms by separating certain β-developments from other β-reductions. We give proofs based on this technique for several fundamental theorems in...
2005 / Hongwei Xi -
Equational Cryptographic Reasoning in the Maude-NRL Protocol Analyzer
Abstract The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-life protocols. One of the most interesting of its features is...
2007 / Santiago Escobar, Catherine Meadows, José Meseguer -
A Coordination-based Methodology for Security Protocol Verification
Abstract The quest for the formal certification of properties of systems is one of the most challenging research issues in the field of formal methods. It requires the development of formal models together with effective verification techniques. In...
2005 / Giacomo Baldi, Andrea Bracciali, Gianluigi Ferrari, Emilio Tuosto -
Convincing Proofs for Program Certification
Abstract At the highest level of formal certification, the current research trend consists in providing evaluators with a formal checkable proof produced by automatic verification tools. The aim is to reduce the certification process to verifying...
2009 / Manuel Garnacho, Michaël Périn -
A Coq Library for Verification of Concurrent Programs
Abstract Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially focused on formalization of abstract systems, such as pure...
2008 / Reynald Affeldt, Naoki Kobayashi -
Rewriting Techniques in the Constraint Solver
Abstract The constraint solver is a symbolic cryptographic protocol security analysis tool that is based on a unique term rewriting approach. Several of the design characteristics of this tool, and the reasons for them, are discussed and placed in...
2009 / Jonathan Millen -
Formal Security Analysis for Ad-Hoc Networks
Abstract In ad-hoc networks, autonomous wireless nodes can communicate by forwarding messages for each other. For routing protocols in this setting, it is known that a malicious node can perform a variety of attacks just by not behaving according to ...
2005 / Sebastian Nanz, Chris Hankin -
A Monotonicity Principle for Information Theory
Abstract We establish a monotonicity principle for convex functions that enables high-level reasoning about capacity in information theory. Despite its simplicity, this single idea is remarkably applicable. It leads to a significant extension of...
2008 / Konstantinos Chatzikokolakis, Keye Martin -
Web Interfaces for Proof Assistants
Abstract This article describes an architecture for creating responsive web interfaces for proof assistants. The architecture combines current web development technologies with the functionality of local prover interfaces, to create an interface...
2007 / Cezary Kaliszyk -
What Level of Mathematical Reasoning can Computer Science Demand of a Software Implementer?
Abstract The article starts out from the observation that software engineering splits in two large activity areas: Software specification with its verification and software implementation with its verification. To find answers to the question in the ...
2005 / Hans Langmaack -
Visualizing Geometrical Statements with GeoView2004 / Yves Bertot, Frédérique Guilhot, Loïc Pottier
-
Slicing-based Hardware/Software Co-design Methodology From Functional Specifications
Abstract Program slicing is a software analysis technique and generates System Dependence Graphs (SDGs) by which dependences among program statements can be identified. In this paper, we propose a new hardware-software co-design methodology based on ...
2006 / Shunsuke Sasaki, Tasuku Nishihara, Masahiro Fujita