Sciweavers

452 search results - page 84 / 91
» Incremental formal design verification
Sort
View
C3S2E
2010
ACM
13 years 8 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
ENTCS
2006
100views more  ENTCS 2006»
13 years 7 months ago
Towards a Logic for Performance and Mobility
Klaim is an experimental language designed for modeling and programming distributed systems composed of mobile components where distribution awareness and dynamic system architect...
Rocco De Nicola, Joost-Pieter Katoen, Diego Latell...
MAGS
2008
169views more  MAGS 2008»
13 years 7 months ago
ACVisualizer: A visualization tool for APi-calculus
Process calculi are mathematical tools used for modeling and analyzing the structure and behavior of reactive systems. One such calculus, called APi-calculus (an extension to Pi-ca...
Raheel Ahmad, Shahram Rahimi
ACSAC
2010
IEEE
13 years 5 months ago
Keeping data secret under full compromise using porter devices
We address the problem of confidentiality in scenarios where the attacker is not only able to observe the communication between principals, but can also fully compromise the commu...
Christina Pöpper, David A. Basin, Srdjan Capk...
SIGSOFT
2009
ACM
14 years 8 months ago
Automatic steering of behavioral model inference
Many testing and analysis techniques use finite state models to validate and verify the quality of software systems. Since the specification of such models is complex and timecons...
David Lo, Leonardo Mariani, Mauro Pezzè