Sciweavers

1226 search results - page 203 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
TACAS
2005
Springer
129views Algorithms» more  TACAS 2005»
15 years 5 months ago
A New Algorithm for Strategy Synthesis in LTL Games
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
Aidan Harding, Mark Ryan, Pierre-Yves Schobbens
ASSETS
2004
ACM
15 years 5 months ago
Nonvisual tool for navigating hierarchical structures
The hierarchical structure of a program can be quite complex. As such, many Integrated Development Environments (IDEs) provide graphical representations of program structure at di...
Ann C. Smith, Justin S. Cook, Joan M. Francioni, A...
ICALP
2001
Springer
15 years 4 months ago
Secure Games with Polynomial Expressions
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...
Aggelos Kiayias, Moti Yung
SIGADA
2001
Springer
15 years 4 months ago
Targeting Ada95/DSA for distributed simulation of multiprotocol communication networks
The last years have seen an increasing, albeit restricted simulation of large-scale networks on shared memory parallel platforms. As the complexity of communication protocols and ...
Dhavy Gantsou
TOOLS
2000
IEEE
15 years 4 months ago
More Meaningful UML Models
UML is widely used today for modelling complex systems. However, the tools support capabilities for UML is limited, partially due to its lack of precise semantics. There are some ...
Ileana Ober