Sciweavers

597 search results - page 58 / 120
» Formal Techniques for Java-Like Programs
Sort
View
LPNMR
2009
Springer
14 years 2 months ago
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
Abstract. In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at s...
Jörg Pührer, Hans Tompits
IFIP
2004
Springer
14 years 1 months ago
Safety assessment with AltaRica
: AIRBUS and ONERA used the AltaRica formal language and associated tools to perform safety assessments. Lessons learnt during the study of an electrical and hydraulic system are p...
Pierre Bieber, Christian Bougnol, Charles Castel, ...
ICSE
2008
IEEE-ACM
14 years 8 months ago
Calysto: scalable and precise extended static checking
Automatically detecting bugs in programs has been a long-held goal in software engineering. Many techniques exist, trading-off varying levels of automation, thoroughness of covera...
Domagoj Babic, Alan J. Hu
FAC
2008
100views more  FAC 2008»
13 years 7 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
KBSE
2005
IEEE
14 years 1 months ago
On dynamic feature location
Feature location aims at locating pieces of code that implement a given set of features (requirements). It is a necessary first step in every program comprehension and maintenanc...
Rainer Koschke, Jochen Quante