Sciweavers

84 search results - page 11 / 17
» Improvements to the Implementation of Interpolant-Based Mode...
Sort
View
FAC
2008
100views more  FAC 2008»
14 years 9 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
MOMM
2009
ACM
163views Communications» more  MOMM 2009»
15 years 2 months ago
Tools for designing and prototyping activity-based pervasive applications
This paper proposes a new approach for modelling, testing and prototyping pervasive, possibly mobile, and distributed applications. It describes a set of tools aimed at supporting...
Pascal Bruegger, Denis Lalanne, Agnes Lisowska, B&...
FMSD
2008
110views more  FMSD 2008»
14 years 9 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
103
Voted
CAISE
2010
Springer
14 years 10 months ago
Beyond Process Mining: From the Past to Present and Future
Abstract. Traditionally, process mining has been used to extract models from event logs and to check or extend existing models. This has shown to be useful for improving processes ...
Wil M. P. van der Aalst, Maja Pesic, Minseok Song
POPL
2003
ACM
15 years 9 months ago
From symptom to cause: localizing errors in counterexample traces
There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a symptom...
Thomas Ball, Mayur Naik, Sriram K. Rajamani