Sciweavers

913 search results - page 123 / 183
» Toward Formalizing Structured Analysis
Sort
View
CCS
2005
ACM
14 years 1 months ago
Provable anonymity
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
Flavio D. Garcia, Ichiro Hasuo, Wolter Pieters, Pe...
ICTAI
1999
IEEE
14 years 2 days ago
Search Strategies for Hybrid Search Spaces
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
Carla P. Gomes, Bart Selman
EMSOFT
2007
Springer
14 years 1 months ago
Proving the absence of run-time errors in safety-critical avionics code
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
Patrick Cousot
TYPES
2000
Springer
13 years 11 months ago
A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
VRML
2009
ACM
14 years 2 months ago
Interactive stories on the net: a model and an architecture for X3D worlds
This work discusses a model and an architecture for interactive stories to be displayed on the net, designed for being independent from the specific story represented and suitabl...
Efrem Carnielli, Fabio Pittarello