Sciweavers

1818 search results - page 342 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
CCS
2000
ACM
14 years 1 months ago
Composition and integrity preservation of secure reactive systems
We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the wellknown simulatability approach, i.e., the specification is an ...
Birgit Pfitzmann, Michael Waidner
ECAI
2000
Springer
14 years 1 months ago
Towards Real-Time Search with Inadmissible Heuristics
Real-time search has two aspects, one as an efficient search method (in a single problem solving trial), and the other as an overall problem solving architecture with learning abi...
Masashi Shimbo, Toru Ishida
INFOCOM
2009
IEEE
14 years 3 months ago
Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Netwo
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
Krishnaiyan Thulasiraman, Muhammad S. Javed, Guoli...
ESOP
2009
Springer
14 years 3 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
SIGSOFT
2007
ACM
14 years 9 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip