N. Halbwachs. Delay analysis in synchronous programs. In Computer Aided Veri- cation, pages 333-346, 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....and can prove termination in many instances where the old analysis could not. For this new analysis we use abstract interpretation over a domain of convex constraints to perform the IR analysis. The use of convex constraints as an abstract domain is well understood and has had many applications [9, 14, 15], including time complexity analysis [19] and termination analysis of logic programs [5] Although we assume no particular knowledge of Mercury, it is assumed that the reader is familiar with the basic principles of logic programming. For an overview of these matters we refer the reader to Lloyd ....

N. Halbwachs. Delay analysis in synchronous programs. In Computer Aided Veri cation, pages 333-346, 1993.

....[14] a number of important data flow analysis problems such as array bound checking, compile time overflow detection, loop invariant computations and loop induction variables. Convex polyhedra are also used, among many other applications, for the analysis and verification of synchronous languages [7, 19] and of linear hybrid automata (an extension of finite state machines that models time requirements) 21, 23] for the computer aided formal verification of concurrent and reactive systems based on temporal specifications [28] for inferring argument size relationships in logic languages [5] and ....

N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor, Computer Aided Verification: Proceedings of the 5th International Conference, volume 697 of Lecture Notes in Computer Science, pages 333--346, Elounda, Greece, 1993. Springer-Verlag, Berlin.

....[15] several important data flow analysis problems such as array bound checking, compiletime overflow detection, loop invariant computations and loop induction variables. Convex polyhedra are also used, among many other applications, for the analysis and verification of synchronous languages [6, 23] and of linear hybrid automata (an extension of finite state machines that models time requirements) 24, 27] for the computer aided formal verification of concurrent and reactive systems based on temporal specifications [29] for inferring argument size relationships in logic languages [4, 5] ....

.... (symbolic model checking of linear hybrid systems) A further step toward more precision is proposed in [28] where the authors present another extrapolation operator used in the HyTech system: This operator is tighter than (and therefore less aggressive than) both the widening operator of [23] and the extrapolation operator of [26] which is not monotone in its second argument. Other extrapolation operators based on similar approaches have been sketched in [6] Still in the field of automatic verification, the need for more precision than warranted by the standard widening is ....

N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor, Computer Aided Verification: Proceedings of the 5th International Conference, volume 697 of Lecture Notes in Computer Science, pages 333--346, Elounda, Greece, 1993. Springer-Verlag, Berlin.

....been partly supported by MURST projects Abstract Interpretation, type systems and control flow analysis and Aggregate and number reasoning for computing: from decision algorithms to constraint programming with multisets, sets, and maps and by EPSRC grant GR R53401 01. synchronous languages [6, 18] and of linear hybrid automata (an extension of finite state machines that models time requirements) 20, 22] for the computeraided formal verification of concurrent and reactive systems based on temporal specifications [27] for inferring argument size relationships in logic languages [5] and ....

N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor, Computer Aided Verification: Proceedings of the 5th International Conference, volume 697 of Lecture Notes in Computer Science, pages 333--346, Elounda, Greece, 1993. Springer-Verlag, Berlin.

....3 Let f be the synchronization function defined by f(a; 0) a, f(b; b) b and f(0; c) c. Then the automaton Cm;n in Figure 1 is isomorphic to the part of Am Omega f Bn which is reachable from (h 0 ; k 0 ) 2 3 A Logic for Safety and Bounded Liveness Properties It has been pointed out [14, 11], that the practical goal of verification of real time systems, is to verify simple safety properties such as deadlock freeness and mutual exlusion. Our previous work [11] shows that such properties can be verified on the fly by simple reachability analysis which avoids construction of the whole ....

Nicolas Halbwachs. Delay Analysis in Synchronous Programs. Lecture Notes in Computer Science, 697,

....we were able to automatically verify the safety properties of the consistency protocol. Being a full edged model checker for temporal properties, the tool of [BGL00,YKTB01] and its predecessor [BGP97,BGP99] without the CUDD component but enriched with approximation operators (e.g. widening [CC77,Hal93] allowed us to study other temporal properties for the abstract protocol. We exploited this feature to prove a weak form of liveness properties for di erent formulations of the protocol. To our knowledge, this is the rst time that constraint technologies based on composite symbolic ....

....composing all atomic actions. Presburger Model Checker [BGP99] In general, for the class of systems that can be speci ed in Action Language CTL model checking is undecidable. We are currently working on extending the Composite Symbolic Library with approximation operations such as widening [Hal93] Such operations have been successfully used for the veri cation of in nite state systems using linear arithmetic constraints [BGP99] Since Composite Symbolic Library does not support approximations yet, we used the Presburger model checker from [BGP97,BGP99] in our experiments for approximate ....

[Article contains additional citation context not shown here]

N. Halbwachs. Delay Analysis in Synchronous Programs. In Proc. CAV'93, LNCS 697, pp. 333-346, 1993.

....timed version of the Bounded Retransmission Protocol. 1 Introduction Counter automata and clock automata (timed automata) are widely used models of both hardware and software systems. A lot of effort has been devoted to the design of analysis techniques for these models (see e.g. AD94, HNSY92, Hal93, BW94, BGL98, CJ98] While the verification problem is undecidable in general for counter automata, this problem is decidable for timed automata [AD94] and there are model checking algorithms and efficient verification tools for them [DOTY96, LPY97] In this paper, we address the problem of ....

....techniques and show their use in reachability analysis. In Section 6, we discuss the current status of our implementation and experiments. Related Work: The (semi )algorithmic symbolic approach have been used for counter automata and timed systems in many works such as [CH78, HNSY92, Hal93, BW94, HHWT95, BGL98, BGP98, CJ98] However, none of the existing works can deal with systems with nonlinear sets of reachable configurations. Our extrapolation techniques have the same motivation as the widening operations [CH78, BGP98] used in the framework of abstract interpretation [CC77] ....

[Article contains additional citation context not shown here]

N. Halbwachs. Delay Analysis in Synchronous Programs. In CAV'93. LNCS 697, 1993.

....very useful for modeling systems which use parameters (e.g. time) taking values on an infinite (or very large) domain. The domain of the arithmetic variables is either dense (e.g. reals) as used in the model of timed automata [1, 7] discrete as used in the model of automata with (delay ) counters [6], or mixed (hybrid automata) Here we focus on automata with counters over a discrete domain. In this paper we present a new method for determining state invariants for finite state automata with counters. Our method not only provides a new tool for program analysis, but is also an interesting ....

....of logic programming techniques. 0 This work was performed while the second author was a visiting research fellow at the Ecole Normale Sup erieure, funded by EC HCM grants Compulog ERBCHBGCT 930365 and Logic Program Synthesis and Transformation CHRX.CT.93 0414. Existing methods (e.g. [6, 9]) make use of an approximation operation called widening. One of the drawbacks of widening is that it decreases the accuracy of the resulting invariant. Our new method reduces the need for widening by exploiting two techniques for calculating precise fixed points. As in [6] the automaton is ....

[Article contains additional citation context not shown here]

N. Halbwachs. Delay analysis in synchronous programs. In Proceedings of conference on Computer-Aided Verification, 1993, pages 333--346, 1993.

....parameterized cache coherence protocols to a reachability 1 Uniform Memory Access with local Caches model. 1 problem for EFSMs. The last problem can be attacked using general purpose, in nite state symbolic model checking methods de ned for integers or real arithmetics (see e.g. BGP97, BW98, Hal93, HHW97, DP99, SKR98] In our approach we apply ecient tools based on real arithmetics (thus applying a relaxation from integers to reals during the analysis) to automatically check safety properties like data consistency for snoopy, write invalidate and write update cache coherence protocols for ....

....I.1) and 2 = invalid 0; exclusive 0; dirty 2; shared 0 (property I.2) We automatically checked both properties using HyTech and DMC (without need of accelerations) as speci ed in Fig. 4. HyTech execution times are often better (HyTech is based on Halbwachs ecient polyhedra library [Hal93] However, the HyTech built in command reach backward we use for the analysis does not terminate in two cases (see table) DMC terminates on all examples thanks to a set of built in accelerations (that don t cause loss of precision) DP99b] Similar techniques (e.g. extrapolation) are described ....

N. Halbwachs. Delay analysis in synchronous programs. In Proceedings of the Fifth Conference on Computer-Aided Verication (CAV'93), volume 697 of LNCS. Springer, 1993.

No context found.

N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor, Proc. of the 5th Int. Conference on Computer Aided Verification, volume 697 of LNCS, pages 333--346. Springer, 1993.

No context found.

N. Halbwachs. Delay analysis in synchronous programs. In Computer Aided Veri- cation, pages 333-346, 1993.

No context found.

N. Halbwachs. Delay analysis in synchronous programs. In Fifth Conference on Computer-Aided Verification, Elounda (Greece), July 1993. LNCS 697, Springer Verlag.

No context found.

N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor, Computer Aided Verification: Proceedings of the 5th International Conference, volume 697 of Lecture Notes in Computer Science, pages 333--346, Elounda, Greece, 1993. Springer-Verlag, Berlin.

No context found.

N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor, Computer Aided Verification: Proceedings of the 5th International Conference, volume 697 of Lecture Notes in Computer Science, pages 333--346, Elounda, Greece, 1993. Springer-Verlag, Berlin.

No context found.

N. Halbwachs. Delay analysis in synchronous programs. In CAV 93: Computer-aided Verification, LNCS 697, pp. 333--346. Springer, 1993.

No context found.

N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor, Computer Aided Verification: Proceedings of the 5th International Conference, volume 697 of Lecture Notes in Computer Science, pages 333--346, Elounda, Greece, 1993. Springer-Verlag, Berlin.

No context found.

N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor, Computer Aided Verification: Proceedings of the 5th International Conference, volume 697 of Lecture Notes in Computer Science, pages 333--346, Elounda, Greece, 1993. Springer-Verlag, Berlin.

No context found.

N. Halbwachs, Delay analysis in synchronous programs, in: C. Courcoubetis (Ed.), Computer Aided Verification: Proceedings of the 5th International Conference, Vol. 697 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, Elounda, Greece, 1993, pp. 333--346.

No context found.

N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor, Computer Aided Verification: Proceedings of the 5th International Conference, volume 697 of Lecture Notes in Computer Science, pages 333--346, Elounda, Greece, 1993. Springer-Verlag, Berlin.

No context found.

N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor, Computer Aided Verification: Proceedings of the 5th International Conference, volume 697 of Lecture Notes in Computer Science, pages 333--346, Elounda, Greece, 1993. Springer-Verlag, Berlin.

No context found.

N. Halbwachs, Delay analysis in synchronous programs, in: C. Courcoubetis (Ed.), Computer Aided Verification: Proceedings of the 5th International Conference, Vol. 697 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, Elounda, Greece, 1993, pp. 333--346.

No context found.

N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor, Computer Aided Verification: Proceedings of the 5th International Conference, volume 697 of Lecture Notes in Computer Science, pages 333--346, Elounda, Greece, 1993. Springer-Verlag, Berlin.

No context found.

N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor, Computer Aided Verification: Proceedings of the 5th International Conference, volume 697 of Lecture Notes in Computer Science, pages 333--346, Elounda, Greece, 1993. Springer-Verlag, Berlin.

No context found.

N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor, Proceedings of computer aided verification, volume 697 of Lecture Notes in Computer Science, pages 333--346. Springer-Verlag, 1993.

No context found.

N. Halbwachs. Delay Analysis in Synchronous Programs. In Proc. CAV '93, LNCS 697, pp. 333--346, 1993.

First 50 documents  Next 50

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