Zobrazeno 1 - 10
of 300
pro vyhledávání: '"Amir Pnueli"'
Publikováno v:
Journal of the ACM. 66:1-31
We show how to construct temporal testers for the logic MITL, a prominent linear-time logic for real-time systems. A temporal tester is a transducer that inputs a signal holding the Boolean value of atomic propositions and outputs the truth value of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e29b1a3e48c09895b94098dfa728c72
https://doi.org/10.1145/3286976
https://doi.org/10.1145/3286976
Autor:
Nir Piterman, Amir Pnueli
Publikováno v:
Handbook of Model Checking ISBN: 9783319105741
Handbook of Model Checking
Handbook of Model Checking
Temporal logic has been used by philosophers to reason about the way the world changes over time. Its modern use in specification and verification of systems describes the evolution of states of a program/design giving rise to descriptions of executi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::85ea0f919fde9ac6329573a169b5dd81
https://doi.org/10.1007/978-3-319-10575-8_2
https://doi.org/10.1007/978-3-319-10575-8_2
Publikováno v:
Journal of Computer and System Sciences. 78:981-996
It has long been known that past-time operators add no expressive power to linear temporal logics. In this paper, we consider the extension of branching temporal logics with past-time operators. Two possible views regarding the nature of past in a br
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::64aed13e32c83934e9af920d0862b128
https://doi.org/10.1016/j.jcss.2011.08.006
https://doi.org/10.1016/j.jcss.2011.08.006
Publikováno v:
Information and Computation. 211:138-159
Even though many attempts have been made to define the boundary between decidable and undecidable hybrid systems, the affair is far from being resolved. More and more low dimensional systems are being shown to be undecidable with respect to reachabil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a9b6ae5b4b4a3a236bd7a9e84c176481
https://doi.org/10.1016/j.ic.2011.11.006
https://doi.org/10.1016/j.ic.2011.11.006
Autor:
Amir Pnueli, Dov M. Gabbay
Publikováno v:
Logic Journal of IGPL. 16:499-536
The paper presents a compositional approach to the verification of CTL* properties over reactive systems. Both symbolic model-checking (SMC) and deductive verification are considered. Both methods are based on two decomposition principles. A general
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19c9a22c21a277eaf0553b12eb499379
https://doi.org/10.1093/jigpal/jzn018
https://doi.org/10.1093/jigpal/jzn018
Autor:
Nir Piterman, Stefan Galler, Barbara Jobstmann, Amir Pnueli, Martin Weiglhofer, Roderick Bloem
Publikováno v:
TU Graz
We propose to use a formal specification language as a high-level hardware description language. Formal languages allow for compact, unambiguous representations and yield designs that are correct by construction. The idea of automatic synthesis from
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f0ba7b78453e8e00d22412bf06ebe9f
https://doi.org/10.1016/j.entcs.2007.09.004
https://doi.org/10.1016/j.entcs.2007.09.004
Publikováno v:
International Journal of Foundations of Computer Science. 18:5-44
Predicate abstraction has become one of the most successful methodologies for proving safety properties of programs. Recently, several abstraction methodologies have been proposed for proving liveness properties. This paper studies "ranking abstracti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0edd23ef52b5958893bfea6dc8b53885
https://doi.org/10.1142/s0129054107004553
https://doi.org/10.1142/s0129054107004553
Publikováno v:
Electronic Notes in Theoretical Computer Science. 144:73-89
We consider the problem of a module interacting with an external interface (environment) where the interaction is expected to satisfy some system specification Φ. While we have the full implementation details of the module, we are only given a parti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4cfaa5a76a0e5dcafa9465aafd7a6296
https://doi.org/10.1016/j.entcs.2006.02.005
https://doi.org/10.1016/j.entcs.2006.02.005
Publikováno v:
International Journal on Software Tools for Technology Transfer. 8:261-279
The method of invisible invariants was developed originally in order to verify safety properties of parameterized systems in a fully automatic manner. The method is based on (1) a project&generalize heuristic to generate auxiliary constructs for para
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8a6c3b7230c9d992eee9cc2d9ec09f8
https://doi.org/10.1007/s10009-005-0193-x
https://doi.org/10.1007/s10009-005-0193-x
Autor:
Amir Pnueli, Ofer Strichman
Publikováno v:
Electronic Notes in Theoretical Computer Science. 144(2):53-65
A reduction of Equality Logic with Uninterpreted Functions (EUF) to Equality Logic with Ackermann's method suffers from a quadratic growth in the number of functional consistency constraints (constraints of the form x=y->F(x)=F(y)). We propose a fram
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f333b420f6f8cd6f28aabf4c853196e5