Sciweavers

1799 search results - page 156 / 360
» The Logic of Correctness in Software Engineering
Sort
View
ICSE
1997
IEEE-ACM
15 years 11 months ago
A Theory of Probabilistic Functional Testing
We propose a framework for “probabilistic functional testing.” The success of a test data set generated according to our method guarantees a certain level of confidence into ...
Gilles Bernot, Laurent Bouaziz, Pascale Le Gall
MIDDLEWARE
2007
Springer
16 years 1 months ago
Life cycle support for sensor network applications
Developing applications for sensor networks is a challenging task. Most programming systems narrowly focus on programming issues while ignoring that programming represents only a ...
Urs Bischoff, Gerd Kortuem
IIWAS
2008
15 years 8 months ago
A model-prover for constrained dynamic conversations
In a service-oriented architecture, systems communicate by exchanging messages. In this work, we propose a formal model based on OCL-constrained UML Class diagrams and a methodolo...
Diletta Cacciagrano, Flavio Corradini, Rosario Cul...
PLDI
2011
ACM
14 years 9 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
167
Voted
KBSE
2008
IEEE
16 years 1 months ago
Inferring Finite-State Models with Temporal Constraints
Finite state machine-based abstractions of software behaviour are popular because they can be used as the basis for a wide range of (semi-) automated verification and validation ...
Neil Walkinshaw, Kirill Bogdanov