(Enter summary)
Abstract: We present a method for computing abstractions of infinite state systems compositionally and automatically. Given a concrete system S = S1 || .. || Sn of programs and given an abstraction function a, using our method one can compute an abstract system S[a] = S1[a] || .. || Sn[a] such that S simulates S[a], i.e. every computation of S can be mapped to a computation of S[a]. Thus, if a maps concrete states to abstract states taken from a finite set, we obtain a finite state system S[a] which can... (Update)
Cited by: More
Formal Aspects of Computing A generalized semantics of.. - Gallardo, Merino, al. (2004)
(Correct)
Making Predicate Abstraction Efficient: - How To Eliminate
(Correct)
Counterexample-Guided Abstraction Refinement - For Symbolic Model
(Correct)
Similar documents (at the sentence level):
12.8%: Abstraction as the Key for Invariant Verification - Bensalem, Graf, Lakhnech
(Correct)
Active bibliography (related documents): More All
0.1: Model Checking and Deduction for Verifying Infinite-State.. - Sipma, Uribe, Manna
(Correct)
0.1: Model Checking and Deduction for Infinite-State Systems - Sipma, Uribe, Manna
(Correct)
0.0: Verification of Real-Time Systems by Successive Over and.. - Dill, Wong-Toi (1995)
(Correct)
Similar documents based on text: More All
0.8: Incremental Verification by Abstraction - Lakhnech, Bensalem, Berezin, Owre (2001)
(Correct)
0.2: (De)Compositions of Cryptographic Schemes and their.. - Janvier, Lakhnech.. (2005)
(Correct)
0.2: Verifying Secrecy by Abstract Interpretation - Bozga, Lakhnech, Périn (2002)
(Correct)
Related documents from co-citation: More All
36: Construction of abstract state graphs with pvs
- Graf, Saidi - 1997
24: Property preserving abstractions for the verification of concurrent systems
- Loiseaux, Graf et al. - 1995
21: Abstract interpretation: a unified lattice model for static analysis of programs.. (context) - Cousot, Cousot - 1977
BibTeX entry: (Update)
S. Bensalem, Y. Lakhnech, and S. Owre. Computing Abstractions of Infinite State Systems Compositionally and Automatically. In CAV'98. LNCS 1427, 1998. http://citeseer.ist.psu.edu/bensalem98computing.html More
@inproceedings{ bensalem98computing,
author = "Saddek Bensalem and Yassine Lakhnech and Sam Owre",
title = "Computing Abstractions of Infinite State Systems Compositionally and Automatically",
booktitle = "Computer-Aided Verification, {CAV} '98",
volume = "1427",
publisher = "Springer-Verlag",
address = "Vancouver, Canada",
editor = "Alan J. Hu and Moshe Y. Vardi",
pages = "319--331",
year = "1998",
url = "citeseer.ist.psu.edu/bensalem98computing.html" }
Citations (may not include all citations):
815
Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977
155
ACM Transactions on Programming Languages and Systems (context) - Clarke, Grumberg et al. - 1994
120
A note on reliable full-duplex transmission over half-duplex.. (context) - Barlett, Scantlebury et al. - 1969
65
Powerful techniques for the automatic generation of invarian..
- Bensalem, Lakhnech et al. - 1996
47
Abstract interpretation and partition refinement for model c.. (context) - Dams - 1996
47
Generation of reduced models for checking fragments of CTL (context) - Dams, Gerth et al. - 1993
39
Abstract interpretation of reactive systems (context) - Dams, Gerth et al.
21
Automatic generation of invariants and intermediate assertio..
- Bjorner, Browne et al. - 1997
13
Model checking using adaptive state and data abstraction (context) - Dams, Gerth et al. - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.uni-kiel.de/~yl/): More
Synthesizing different development paradigms.. - J. Zwiers, U..
(Correct)
From Duration Calculus To Linear Hybrid Automata - Bouajjani, Lakhnech, Robbana
(Correct)
Powerful Techniques for the Automatic Generation of Invariants - Bensalem (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC