Sciweavers

158 search results - page 31 / 32
» Modelling Recursive Calls with UML State Diagrams
Sort
View
FOSSACS
2010
Springer
14 years 7 days ago
Reachability Analysis of Communicating Pushdown Systems
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...
Alexander Heußner, Jérôme Lerou...
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
13 years 10 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
LICS
2007
IEEE
14 years 1 days ago
First-Order and Temporal Logics for Nested Words
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
Rajeev Alur, Marcelo Arenas, Pablo Barceló,...
SEKE
2010
Springer
13 years 4 months ago
A String Constraint Solver for Detecting Web Application Vulnerability
Given the bytecode of a software system, is it possible to automatically generate attack signatures that reveal its vulnerabilities? A natural solution would be symbolically execu...
Xiang Fu, Chung-Chih Li
SPIN
2010
Springer
13 years 4 months ago
Analysing Mu-Calculus Properties of Pushdown Systems
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
Matthew Hague, C.-H. Luke Ong