Sciweavers

535 search results - page 84 / 107
» Termination of Abstract Reduction Systems
Sort
View
SIGSOFT
2007
ACM
14 years 10 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
TASE
2007
IEEE
14 years 4 months ago
Automating Language Evolution
The design and implementation of complex software systems ly spans multiple levels of abstractions. The concepts of el of abstractions and their interplay are represented by forma...
Markus Pizka, Elmar Jürgens
PPDP
1999
Springer
14 years 2 months ago
A Calculus for Interaction Nets
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
Maribel Fernández, Ian Mackie
FM
2009
Springer
169views Formal Methods» more  FM 2009»
14 years 1 months ago
Model Checking Linearizability via Refinement
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
Yang Liu 0003, Wei Chen, Yanhong A. Liu, Jun Sun 0...
ESOP
2008
Springer
13 years 11 months ago
Open Bisimulation for the Concurrent Constraint Pi-Calculus
Abstract. The concurrent constraint pi-calculus (cc-pi-calculus) has been introduced as a model for concluding Service Level Agreements. The cc-pi calculus combines the synchronous...
Maria Grazia Buscemi, Ugo Montanari