Sciweavers

2529 search results - page 305 / 506
» The Logical Structure of Binding
Sort
View
FCT
2007
Springer
16 years 23 days ago
Rewriting Systems with Data
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Miha...
FMICS
2007
Springer
16 years 23 days ago
An Action/State-Based Model-Checking Approach for the Analysis of Communication Protocols for Service-Oriented Applications
Abstract. In this paper we present an action/state-based logical framework for the analysis and verification of complex systems, which relies on the definition of doubly labelled...
Maurice H. ter Beek, Alessandro Fantechi, Stefania...
LFCS
2007
Springer
16 years 22 days ago
Model Checking Knowledge and Linear Time: PSPACE Cases
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
Kai Engelhardt, Peter Gammie, Ron van der Meyden
PPDP
2007
Springer
16 years 22 days ago
Relational semantics for effect-based program transformations with dynamic allocation
We give a denotational semantics to a region-based effect system tracking reading, writing and allocation in a higher-order language with dynamically allocated integer references....
Nick Benton, Andrew Kennedy, Lennart Beringer, Mar...
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
16 years 21 days ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri