Sciweavers

592 search results - page 73 / 119
» Can Component Service-Based Systems Be Proved Correct
Sort
View
TLCA
2005
Springer
14 years 1 months ago
Avoiding Equivariance in Alpha-Prolog
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving...
Christian Urban, James Cheney
ASPDAC
2004
ACM
94views Hardware» more  ASPDAC 2004»
13 years 11 months ago
Improving simulation-based verification by means of formal methods
The design of complex systems is largely ruled by the time needed for verification. Even though formal methods can provide higher reliability, in practice often simulation based ve...
Görschwin Fey, Rolf Drechsler
ASE
2006
122views more  ASE 2006»
13 years 7 months ago
Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis
The structured programming literature provides methods and a wealth of heuristic knowledge for guiding the construction of provably correct imperative programs. We investigate the...
Andrew Ireland, Jamie Stark
ASPLOS
2012
ACM
12 years 3 months ago
Path-exploration lifting: hi-fi tests for lo-fi emulators
Processor emulators are widely used to provide isolation and instrumentation of binary software. However they have proved difficult to implement correctly: processor specificati...
Lorenzo Martignoni, Stephen McCamant, Pongsin Poos...
ISMAR
2007
IEEE
14 years 1 months ago
Visualization of Spatial Sensor Data in the Context of Automotive Environment Perception Systems
Spatial sensor systems in cars are gaining more and more importance. Such sensor systems are the foundation of future safety systems, such as automatic emergency brakes, as well a...
Marcus Tönnis, Rudi Lindlf, Leonhard Walchsh&...