N. Klarlund, A. Mller, and M. I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Parikh Automata and Monadic Second-Order Logics with Linear.. - Klaedtke, Rueß (2002) (5 citations) (Correct)
....complexity analyses, theoretically and practically, on Parikh automata and on the decision procedure for WS1S . Although, WS1S is only non elementary decidable [21, 28] we are encouraged by the results obtained by Mona s highly specialized and tuned automata based decision procedure for WS1S [18]. In many case studies it is shown that Mona behaves well in practice. Our decision procedure for WS1S is even more complex than Mona s decision procedure for WS1S in the sense that we do not only have to construct corresponding automata for the subformulas of a given WS1S sentence but we ....
N. Klarlund, A. M ller, and M. Schwartzbach, MONA implementation secrets, in CIAA'00, vol. 2088 of LNCS, 200, pp. 182-194.
Parikh Automata and Monadic Second-Order Logics with Linear.. - Klaedtke, Rueß (2002) (5 citations) (Correct)
....a multitude of computation systems ranging from sequential circuits [2,3] and imperative programs A preliminary version has appeared as Technical Report number 177 at the AlbertLudwigs Univerist at Freiburg, Institut f ur Informatik. with pointers [10] to protocols [20, 29] The Mona tool [15, 19] provides ecient implementations of automata based decision procedure for WS1S and WS2S. The automata theoretic decision procedures are also used to decide well de ned fragments of higher order logic [1, 24] Many interesting veri cation problems however fall outside the scope of WS1S and WS2S. ....
....built on top of a decision procedure for Presburger arithmetic and a translation from WS1S formulas to nite word automata. Although the complexity is in the worst case in both cases very high [13,22,30] we are encouraged by the results obtained by Mona s automatabased decision procedure for WS1S [19]. We hope that similar results can be achieved for the decidable fragment of WS1S . ....
N. Klarlund, A. M ller, and M. Schwartzbach, MONA implementation secrets, in CIAA'00, vol.
On the Theory of Structural Subtyping - Kuncak, Rinard (2003) (Correct)
....complexity of theories. The complexity of our the decidability for structural subtyping non recursive types is non elementary and is a consequence of the non elementary complexity of the term algebra, whose elements and operations are present in the theory of structural subtyping. Tools like MONA [25] show that non elementary complexity does not necessarily make the implementation of a decision procedure uninteresting. An interesting property of quantifier elimination is that it can be applied partially to elimination an innermost quantifier from some formula. This property makes our decision ....
....infinite trees. Second, the embedding suggests even greater di#culties in implementing a decision procedure for the first order theory of structural subtyping (provided that it exists) While we know at least one interesting example of weak monadic second order logic decision procedure, namely [25] we are not aware of any implementation of the full monadic secondorder logic decision procedure for the infinite tree. The relationship between the non structural as well as structural subtyping and monadic second order logic of the infinite binary tree and tree like structures [58] requires ....
Nils Klarlund, Anders Mller, and Michael I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. Lecture Notes in Computer Science, 2000. 8
Data Structures and Algorithms for Efficient Shape Analysis - Manevich (2003) (Correct)
....and SLAM [Mic01] use OBDDs to represent sets ( bit vectors ) and interpretations of propositional (rather than first order) structures. PAG also employs persistent data structures for static analysis, exploiting inherited sharing. Mona uses BDDs to represent transitions of a tree automaton [KMS00] which is used to implement a decision procedure used for Hoare style verification. Mauborgne [Mau98] explores the use of TDGs (a refinement of OBDDs) in abstract interpretation, using them to encode higher order functions for strictness analysis, and presents empirical results on analysis time ....
Nils Klarlund, Anders Moller, and Michael I. Schwartzbach. MONA implementation secrets. In CIAA, pages 182--194, 2000.
On the Theory of Structural Subtyping - Kuncak, Rinard (2003) (Correct)
....of theories. 48 The complexity of our the decidability for structural subtyping non recursive types is non elementary and is a consequence of the non elementary complexity of the term algebra, whose elements and operations are present in the theory of structural subtyping. Tools like MONA [25] show that non elementary complexity does not necessarily make the implementation of a decision procedure uninteresting. An interesting property of quanti er elimination is that it can be applied partially to elimination an innermost quanti er from some formula. This property makes our decision ....
....over in nite trees. Second, the embedding suggests even greater diculties in implementing a decision procedure for the rst order theory of structural subtyping (provided that it exists) While we know at least one interesting example of weak monadic second order logic decision procedure, namely [25] we are not aware of any implementation of the full monadic secondorder logic decision procedure for the in nite tree. The relationship between the non structural as well as structural subtyping and monadic second order logic of the in nite binary tree and tree like structures [58] requires ....
Nils Klarlund, Anders M ller, and Michael I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. Lecture Notes in Computer Science, 2000.
Compactly Representing First-Order Structures for.. - Manevich.. (2002) (11 citations) (Correct)
....PAG [7] and SLAM [9] use OBDDs to represent sets ( bit vectors ) and interpretations of propositional (rather than first order) structures. PAG also employs persistent data structures for static analysis, exploiting inherited sharing. Mona uses BDDs to represent transitions of a tree automaton [5], which is used to implement a decision procedure used for Hoare style verification. Mauborgne [8] explores the use of TDGs (a refinement of OBDDs) in abstract interpretation, using them to encode higher order functions for strictness analysis, and presents empirical results on analysis time (but ....
N. Klarlund, A. Moller, and M. I. Schwartzbach. MONA implementation secrets. In CIAA, pages 182--194, 2000.
Program Verification with Monadic Second-Order Logic & Languages.. - Møller (2002) Self-citation (Mller) (Correct)
No context found.
N. KLARLUND, A. MLLER, AND M. I. SCHWARTZBACH, MONA implementation secrets, International Journal of Foundations of Computer Science, (2002.
On Field Constraint Analysis - Wies, Kuncak, Lam, Podelski, Rinard (2006) (1 citation) (Correct)
No context found.
N. Klarlund, A. Mller, and M. I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000.
A Better Logic and Decision Procedure for Predicate.. - Rakamaric, Bingham, Hu (2006) (Correct)
No context found.
N. Klarlund, A. Mller, and M. I. Schwartzbach. MONA implementation secrets. In Conf. on Implementation and Application of Automata (CIAA), 2000.
An Overview of the Jahob Analysis System - Project Goals and.. - Kuncak, Rinard (Correct)
No context found.
N. Klarlund, A. Mller, and M. I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000.
Crosscutting Techniques in Program Specification and Analysis - Lam, Kuncak, Rinard (2005) (Correct)
No context found.
N. Klarlund, A. Mller, and M. I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000.
On Modular Pluggable Analyses Using Set Interfaces - Lam, Kuncak, Rinard (2003) (Correct)
No context found.
Nils Klarlund, Anders Mller, and Michael I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000.
Modular Pluggable Analyses for Data Structure Consistency - Kuncak, Lam, Zee, Rinard (Correct)
No context found.
N. Klarlund, A. Mller, and M. I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000.
On Relational Analysis of Algebraic Datatypes - Kuncak, Jackson (Correct)
No context found.
Nils Klarlund, Anders Mller, and Michael I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000.
Object Models, Heaps, and Interpretations - Martin Rinard And (Correct)
No context found.
Nils Klarlund, Anders Mller, and Michael I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000.
On the Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2003) (Correct)
No context found.
Nils Klarlund, Anders Mller, and Michael I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000.
On Modular Pluggable Analyses Using Set Interfaces - Lam, Kuncak, Rinard (2003) (Correct)
No context found.
Nils Klarlund, Anders Mller, and Michael I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000.
On the Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2003) (Correct)
No context found.
Nils Klarlund, Anders Mller, and Michael I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000. 6.4
A MONA-based Decision Procedure for Propositional Interval.. - Gomez, Bowman (2003) (Correct)
No context found.
N. Klarlund, A. Mller, and M. I. Schwartzbach. MONA implementation secrets. International Journal of Foundations of Computer Science, 13(4):571--586, 2002.
Object Models, Heaps, and Interpretations - Martin Rinard And (Correct)
No context found.
Nils Klarlund, Anders Mller, and Michael I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000.
Deciding Agent Logics - From KARO to WSnS - Hirsch (2001) (Correct)
No context found.
Nils Klarlund, Anders M ller, and Michael I. Schwartzbach. MONA implementation secrets. In Fifth International Conference on Implementation and Application of Automata. CIAA '00, 2000.
Polynomial Time Image Computation with Interval-definable.. - Finkel, Leroux (2004) (Correct)
No context found.
Nils Klarlund, A. M ller, and M. I. Schwartzbach. MONA implementation secrets. #### ## ## ########### ######## #######, 13(4):571-586, 2002.
On the Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2004) (Correct)
No context found.
Nils Klarlund, Anders Mller, and Michael I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000.
Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2004) (Correct)
No context found.
Nils Klarlund, Anders Mller, and Michael I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000.
On Modular Pluggable Analyses Using Set Interfaces - Lam, Kuncak, Rinard (2003) (Correct)
No context found.
Nils Klarlund, Anders Mller, and Michael I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000.
First 50 documents
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