75,520 Hits in 3.8 sec

Proving Programs Incorrect Using a Sequent Calculus for Java Dynamic Logic [chapter]

Philipp Rümmer, Muhammad Ali Shah
Lecture Notes in Computer Science  
Testing a program, in contrast, means to search for a witness that the program is incorrect. In the present paper, we use a program logic for Java to prove the incorrectness of programs.  ...  We show that this approach, carried out in a sequent calculus for dynamic logic, creates a connection between calculi and proof procedures for program verification and test data generation procedures.  ...  Acknowledgements We want to thank Wolfgang Ahrendt for many discussions that eventually led to this paper, and Tobias Nipkow for comments on an older version of the paper.  ... 
doi:10.1007/978-3-540-73770-4_3 fatcat:egnszd7enjfiflu5vpfaffrcby

A Programming Logic for Sequential Java [chapter]

Arnd Poetzsch-Heffter, Peter Müller
1999 Lecture Notes in Computer Science  
A Hoare-style programming logic for the sequential kernel of Java is presented.  ...  This paper presents a logic to verify sequential Java programs. The motivations for investigating the logical foundations of Java are as follows: 1.  ...  Based on a formalization of object stores as first-order values, we presented a Hoare-style programming logic for Java-K.  ... 
doi:10.1007/3-540-49099-x_11 fatcat:3rvwkclqgrcujf5gftb6r4r4ae

Java-MOP: A Monitoring Oriented Programming Environment for Java [chapter]

Feng Chen, Grigore Roşu
2005 Lecture Notes in Computer Science  
A Java-based tool-supported software development and analysis framework is presented, where monitoring is a foundational principle.  ...  Expressive requirements specification formalisms can be included into the framework via logic plug-ins, allowing one to refer not only to the current state, but also to both past and future states.  ...  For example, the logic engine for ERE and the Java shell for ERE form the logic plugin for extended regular expressions.  ... 
doi:10.1007/978-3-540-31980-1_36 fatcat:a5kbxo4linedpbbd2zxtrh77vi

A Theorem Proving Approach to Analysis of Secure Information Flow [chapter]

Ádám Darvas, Reiner Hähnle, David Sands
2005 Lecture Notes in Computer Science  
We are able to handle phenomena like method calls, loops, and object types for the target language Java Card. We are also able to prove insecurity of programs.  ...  Most attempts at analysing secure information flow in programs are based on domain-specific logics.  ...  In addition, the KeY system will soon feature metavariables, by which instantiation can be delayed and handed over to an automated theorem prover for first order logic.  ... 
doi:10.1007/978-3-540-32004-3_20 fatcat:rvq6bm5djnhmpchd4oi2dt7zrm

A Case Study in Formal Verification Using Multiple Explicit Heaps [chapter]

Wojciech Mostowski
2013 Lecture Notes in Computer Science  
In the context of the KeY program verifier and the associated Dynamic Logic for Java we discuss the first instance of applying a generalised approach to the treatment of memory heaps in verification.  ...  reasoning that we currently investigate for KeY.  ...  Mostowski is supported by ERC grant 258405 for the VerCors project. We would like to thank Richard Bubel for his insights and invaluable help with the implementation.  ... 
doi:10.1007/978-3-642-38592-6_3 fatcat:4kqfppxxzfdzbj5txhu25a3gi4

Formal Reasoning About Non-atomic Java Card Methods in Dynamic Logic [chapter]

Wojciech Mostowski
2006 Lecture Notes in Computer Science  
We present an extension to JAVA CARD Dynamic Logic, a program logic for reasoning about JAVA CARD programs, to handle JAVA CARD's so-called non-atomic methods.  ...  The extension completes the formalisation of all of JAVA CARD in Dynamic Logic. c Springer-Verlag  ...  We would also like to thank anonymous reviewers and Erik Poll for their helpful comments.  ... 
doi:10.1007/11813040_30 fatcat:hixude5mmza65h4efps3sp4gq4

Dynamic Frames in Java Dynamic Logic [chapter]

Peter H. Schmitt, Mattias Ulbrich, Benjamin Weiß
2011 Lecture Notes in Computer Science  
In this paper we present a realisation of the concept of dynamic frames in a dynamic logic for verifying Java programs.  ...  Syntax and formal semantics of the logic are presented, along with sound proof rules for modularly reasoning about method calls and heap dependent symbols using specification contracts.  ...  Dynamic logic is also used for Java verification in the KIV system [22] .  ... 
doi:10.1007/978-3-642-18070-5_10 fatcat:urch3awtrbacvfjugpig26qfki

Executable and Symbolic Conformance Tests for Implementation Models (Position Paper) [chapter]

Thomas Baar
2002 Lecture Notes in Computer Science  
It stresses the need for formal semantical foundations of all languages that are used to express models. In particular, we classify conformance tests for implementation models.  ...  Acknowledgements My thanks are due to Martin Giese, Reiner Hähnle, and Bernhard Beckert for their comments on earlier drafts of this paper.  ...  Suppose, the implementation model is semantically based on the logical system described in [1] (Dynamic Logic).  ... 
doi:10.1007/3-540-46105-1_27 fatcat:owokh4bkkvez5jgfuyf5ot667y

Performance Comparison of Middleware Architectures for Generating Dynamic Web Content [chapter]

Emmanuel Cecchet, Anupam Chanda, Sameh Elnikety, Julie Marguerite, Willy Zwaenepoel
2003 Lecture Notes in Computer Science  
These benchmarks represent common applications for dynamic content and stress different parts of a dynamic content Web server.  ...  Java servlets execute in a different process from the Web server, allowing them to be located on a separate machine for better load balancing.  ...  Application Logic Implementation In PHP and Java servlets, the application programmer is responsible for writing the SQL queries.  ... 
doi:10.1007/3-540-44892-6_13 fatcat:prtaa6gdyvggffduupj5zsyiby

Parametrized Exceptions [chapter]

Dennis Walter, Lutz Schröder, Till Mossakowski
2005 Lecture Notes in Computer Science  
, which are heavily used in Java control flow.  ...  provide a treatment of this problem in the general framework of exception monads as introduced in earlier work by some of the authors; this framework includes generic partial and total Hoare calculi for  ...  This includes a Hoare logic for partial correctness, a dynamic logic, and a Hoare logic for total correctness defined via dynamic logic.  ... 
doi:10.1007/11548133_27 fatcat:332zmoptfzgtxn6xgp52wrejzq

Automatic Validation of Transformation Rules for Java Verification Against a Rewriting Semantics [chapter]

Wolfgang Ahrendt, Andreas Roth, Ralf Sasse
2005 Lecture Notes in Computer Science  
. = j * j Validating Rules for Java Verification -p.5/20 Aim Java Dynamic Logic Calculus: 480 rules. Out of that: 210 program transformation rules. Other formalisations of Java: e.g.  ...  Validating Rules for Java Verification -p.7/20 Rewriting Logic -R Java Rewriting Logic implementation: Maude.  ... 
doi:10.1007/11591191_29 fatcat:q3tuoznk6bgunpunmrtahohiti

A Program Logic for Handling Java Card's Transaction Mechanism [chapter]

Bernhard Beckert, Wojciech Mostowski
2003 Lecture Notes in Computer Science  
We present sequent calculus rules for the extended logic. Dynamic Logic modified to handle JAVA CARD programs (JAVA CARD DL) [2, 3] .  ...  In this paper we extend a program logic for verifying JAVA CARD applications by introducing a "throughout" operator that allows us to prove "strong" invariants.  ...  JAVA CARD Dynamic Logic Dynamic Logic [7, 8, 10, 12] can be seen as an extension of Hoare logic.  ... 
doi:10.1007/3-540-36578-8_18 fatcat:rjauanmwsbeztoduc2wvjv26xa

Language-independent detection of object-oriented design patterns

Johan Fabry, Tom Mens
2004 Computer languages, systems & structures  
This approach is validated by defining a set of logic queries to detect object-oriented best practice patterns and design patterns in two different languages: Smalltalk and Java.  ...  The queries were applied to two similar medium-sized applications available for each language, and the results were confirmed by manually investigating the source code and available documentation.  ...  Acknowledgments We thank Kim Mens for feedback during the early stages of writing this paper, the entire SOUL development team, Dirk Deridder for proofreading and Theo D'Hondt for supporting this research  ... 
doi:10.1016/ fatcat:ydfmlbbmefg3dnnperclpd4itu

Verification of Safety Properties in the Presence of Transactions [chapter]

Reiner Hähnle, Wojciech Mostowski
2005 Lecture Notes in Computer Science  
The KeY system includes an interactive theorem prover for JAVA CARD source code that models the full JAVA CARD standard including transactions.  ...  Transactions make verification of JAVA CARD programs considerably more difficult, because they cannot be formalised in a logic based on pre-and postconditions.  ...  Acknowledgements We would like to thank Renaud Marlet of Trusted Logic S.A. for providing the Demoney case study. We also thank the organisers of CASSIS'04 for the opportunity to present this work.  ... 
doi:10.1007/978-3-540-30569-9_8 fatcat:fyudygdc2rds5gsxcbh733b3xu

The Delft-Java engine: An introduction [chapter]

C. John Glossner, Stamatis Vassiliadis
1997 Lecture Notes in Computer Science  
Except for kernel programs, programmers need only be concerned with the semantics of the Java programming language.  ...  The instruction set is a 32-bit RISC instruction set architecture with support for multiple concurrent threads and Java speci c constructs.  ...  Architectural support for Multimedia SIMD and DSP instructions is also incorporated into the architecture. 2 Delft-Java Architecture The Delft-Java architecture has two logical views: 1 a JVM Instruction  ... 
doi:10.1007/bfb0002811 fatcat:trbsrq4cxnf7rkj7zc2jqdncbi
« Previous Showing results 1 — 15 out of 75,520 results