Sciweavers

261 search results - page 31 / 53
» Formal Proof from UML Models
Sort
View
ANOR
2002
67views more  ANOR 2002»
13 years 8 months ago
An Improved Hybrid Model for the Generic Hoist Scheduling Problem
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
Daniel Riera, Neil Yorke-Smith
HYBRID
2007
Springer
14 years 15 days ago
Safety Verification of an Aircraft Landing Protocol: A Refinement Approach
Abstract. In this paper, we propose a new approach for formal verification of hybrid systems. To do so, we present a new refinement proof technique, a weak refinement using step in...
Shinya Umeno, Nancy A. Lynch
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
14 years 11 days ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
ANSS
1991
IEEE
14 years 4 days ago
A provably correct, non-deadlocking parallel event simulation algorithm
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
Meng-Lin Yu, Sumit Ghosh, Erik DeBenedictis
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
14 years 2 months ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...