Sciweavers

79 search results - page 15 / 16
» Realizability of Concurrent Recursive Programs
Sort
View
FOSSACS
2009
Springer
15 years 4 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
76
Voted
ICSE
2000
IEEE-ACM
15 years 1 months ago
Little-JIL/Juliette: a process definition language and interpreter
Little-JIL, a language for programming coordination in processes is an executable, high-level language with a formal (yet graphical) syntax and rigorously defined operational seTh...
Aaron G. Cass, Barbara Staudt Lerner, Stanley M. S...
81
Voted
DAC
2004
ACM
15 years 10 months ago
Automated energy/performance macromodeling of embedded software
Efficient energy and performance estimation of embedded software is a critical part of any system-level design flow. Macromodeling based estimation is an attempt to speed up estim...
Anish Muttreja, Anand Raghunathan, Srivaths Ravi, ...
ENTCS
2000
120views more  ENTCS 2000»
14 years 9 months ago
Efficient Substitution in Hoare Logic Expressions
Substitution plays an important role in Hoare Logic, as it is used in interpreting assignments. When writing a computer-based realization of Hoare Logic, it is therefore important...
Roberto Virga
FOCS
2009
IEEE
15 years 4 months ago
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriï...
Yi Deng, Vipul Goyal, Amit Sahai