Sciweavers

394 search results - page 25 / 79
» Formal polytypic programs and proofs
Sort
View
MFCS
1994
Springer
14 years 1 days ago
A Proof System for Asynchronously Communicating Deterministic Processes
We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO bu ers, to cope wi...
Frank S. de Boer, M. van Hulst
ENTCS
2008
106views more  ENTCS 2008»
13 years 8 months ago
Verifying Test-Hypotheses: An Experiment in Test and Proof
HOL-TestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. The HOL-TestGen method is two-staged: first, the origina...
Achim D. Brucker, Lukas Brügger, Burkhart Wol...
PPSWR
2005
Springer
14 years 1 months ago
Descriptive Typing Rules for Xcerpt
We present typing rules for the Web query language Xcerpt. The rules provide a descriptive type system: the typing of a program is an ation of its semantics. The rules can also be ...
Sacha Berger, Emmanuel Coquery, Wlodzimierz Draben...
FATES
2003
Springer
14 years 1 months ago
Using a Software Testing Technique to Improve Theorem Proving
Most efforts to combine formal methods and software testing go in the direction of exploiting formal methods to solve testing problems, most commonly test case generation. Here we ...
Reiner Hähnle, Angela Wallenburg
COMPSAC
1999
IEEE
14 years 9 days ago
Detecting Null Pointer Violations in Java Programs
The use of formal methods has been growing steadily and there have been a number of successful applications of formal methods in a range of application areas. It seems agreed that...
Xiaoping Jia, Sushant Sawant, Jiangyu Zhou, Sotiri...