N. KLARLUND, M. NIELSEN, AND K. SUNESEN, Automated logical verification based on trace abstraction, in Proc. 15th ACM Symposium on Principles of Distributed Computing, PODC '96, May 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....The table below (left) shows the running times for two examples that required 1.12 and 8.33 million apply steps. Example 1 is a verification of timing properties of a flipflop [2] Example 2 is a formula that arises during the verification of a concurrent system against another concurrent system [7]. We originally used the Sparc 1000 multiprocessor, but repeated the tests on a uniprocessor Sparc 4. All reported times are the minimum recorded in several trials on a machine with little load. The times for the Sparc 1000 varied with the load, even if there seemingly are no other active ....

N. Klarlund, M. Nielsen, and K. Sunesen. Automated logical verification based on trace abstraction. Technical Report RS-95-53, BRICS, 1995. To appear in Proceedings of PODC '96.

....[7] to solve interesting and challenging problems. In each case, the results are obtained by exploiting an inherent regularity in the problem domain, thus reducing the problem to questions of regular string or tree languages. Successful applications today include verification of concurrent systems [5], hardware verification [1] and software engineering [4] Work in progress include pointer verification and synthesis of finite state programs. The role of M2L in this approach is to provide an extraordinarily succinct notation for complicated regular sets. The existing applications have ....

Nils Klarlund, Mogens Nielsen, and Kim Sunesen. Automated logical verification based on trace abstraction. In Proceedings of PODC'96, 1996.

.... many interesting projects fit into this niche, including hardware verification [4, 1] pointer analysis [22, 16, 38] controller synthesis [44, 21] natural languages [39] parsing tools [13] software design descriptions [28] Presburger arithmetic [45] and verification of concurrent systems [31, 30, 23, 42, 46]. There are a number of tools resembling Mona. Independent of the Mona project, the first implementation of automata represented with BDDs was that of Gupta and Fischer from 1993 [19] However, they used linear inductive functions instead of the automaton logic connection. MoSeL (see ....

Nils Klarlund, Mogens Nielsen, and Kim Sunesen. Automated logical verification based on trace abstraction. In Proceedings of PODC '96, 1996. 15

....been obsoleted by the WSRT logic (described in Section 7.9) LISA The LISA language [ABP98] was developed in parallel with FIDO. It contains many of the same features as FIDO, but instead of recursive data types, it is based on the more general feature logics. Trace abstractions In [KNS96b, KNS96a] FIDO is used to perform behavioral reasoning about distributed reactive systems based on trace abstractions. M2L Str is used as a temporal logic to address the Broy Lamport challenge of modeling and verification a memory server specification. This work provided the motivation for the ....

Nils Klarlund, Mogens Nielsen, and Kim Sunesen. Automated logical verification based on trace abstraction. In ACM Symposium on Principles of Distributed Computing, PODC '96, 1996.

....queues [2] is but a special case of the BDD represented automata of Mona. Some Mona applications The previous Mona implementation for finite strings is described in [3] We have applied Mona to hardware verification [1] verification of complicated behavioral descriptions of distributed systems [5], and design constraints in software engineering [4] In the latter application, we used a version of Mona for finite trees. In addition, we have built prototypes of tools for graphical representation of search patterns (specified in an extension of regular expressions) and for the automatic ....

....of Hoare logic of pointers. For publications, see our WEB page http: www.brics.aau.dk mbiehl Mona main.html. The largest formula that has been decided by Mona contains half a million characters. This formula is a transcription of a FIDO description of behaviors in distributed memory systems [6, 5]. Semantics The Weak Second order theory of 1 Successor, WS1S, is a variation of predicate logic interpreted over the natural numbers. A first order term is either a variable p or of the form t 1, where t is a first order term and 1 is a function symbol interpreted as the successor function. A ....

N. Klarlund, M. Nielsen, and K. Sunesen. Automated logical verification based on trace abstraction. Technical Report RS-95-53, BRICS, 1995. To appear in Proceedings of PODC '96.

....to solve interesting and challenging problems. In each case, the results are obtained by identifying an inherent regularity in the problem domain, thus reducing the problem to questions of regular string or tree languages. Successful applications today include verification of concurrent systems [9, 8], hardware verification [2] software engineering [10] and pointer verification [7] Work in progress involves a graphical user interface for regular expressions extended with M2L and document logics for the WWW. The role of M2L in this approach is to provide an extraordinarily succinct notation ....

N. Klarlund, M. Nielsen, and K. Sunesen. Automated logical verification based on trace abstraction. In Proceedings of PODC'96, 1996.

....practical implementations have been available, largely due to the adaptation of BDD techniques [4] In [12] the translation techniques for M2L on strings of [7] are extended to trees along with combinatorial techniques and data structures for avoiding state space explosions. FIDO is also used in [9] for the behavioral description of distributed programs and their verification. M2L has also been applied to hardware verification [1] In a technical sense, the most closely related work is in formal linguistics, where recent work has focused on constraint based formalisms. Here the classical ....

N. Klarlund, M. Nielsen, and K. Sunesen. Automated logical verification based on trace abstraction. Technical Report RS95 -53, BRICS, 1995. To appear in Proceedings of PODC '96.

No context found.

N. KLARLUND, M. NIELSEN, AND K. SUNESEN, Automated logical verification based on trace abstraction, in Proc. 15th ACM Symposium on Principles of Distributed Computing, PODC '96, May 1996.

No context found.

RS-95-53 Nils Klarlund, Mogens Nielsen, and Kim Sunesen. Automated Logical Verification based on Trace Abstractions. November 1995.

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