Sciweavers

481 search results - page 53 / 97
» Differential symbolic execution
Sort
View
AIPS
2006
15 years 1 months ago
Safe LTL Assumption-Based Planning
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
Alexandre Albore, Piergiorgio Bertoli
CDC
2008
IEEE
156views Control Systems» more  CDC 2008»
15 years 7 months ago
Diagnosability of hybrid automata with measurement uncertainty
— We propose a diagnosability notion that depends on two parameters denoted as (δd, δm) for the general class of transition systems where the observable output is given by disc...
Maria Domenica Di Benedetto, Stefano Di Gennaro, A...
89
Voted
ITICSE
2005
ACM
15 years 6 months ago
Iconic programming for flowcharts, java, turing, etc
One of the largest barriers to learning programming is the precise and complex syntax required to write programs. This barrier is a key impediment to the integration of programmin...
Stephen Chen, Stephen Morris
94
Voted
ESOP
2005
Springer
15 years 6 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi
ISCA
2010
IEEE
189views Hardware» more  ISCA 2010»
15 years 5 months ago
RETCON: transactional repair without replay
Over the past decade there has been a surge of academic and industrial interest in optimistic concurrency, i.e. the speculative parallel execution of code regions that have the se...
Colin Blundell, Arun Raghavan, Milo M. K. Martin