Sciweavers

1445 search results - page 142 / 289
» Uniformly Hard Languages
Sort
View
EDOC
2007
IEEE
15 years 10 months ago
Getting Rid of the OR-Join in Business Process Models
Abstract— In practice, the development of process-aware information systems suffers from a gap between conceptual business process models and executable workflow specifications...
Jan Mendling, Boudewijn F. van Dongen, Wil M. P. v...
ISVLSI
2007
IEEE
230views VLSI» more  ISVLSI 2007»
15 years 10 months ago
A Methodology and Toolset to Enable SystemC and VHDL Co-simulation
The new design challenges imposed by the increasing difficulties of today’s electronic systems obligated designers to develop new methodologies. System-level design and Platfor...
Richard Maciel, Bruno Albertini, Sandro Rigo, Guid...
TCC
2007
Springer
91views Cryptology» more  TCC 2007»
15 years 10 months ago
Lower Bounds for Non-interactive Zero-Knowledge
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
Hoeteck Wee
IAT
2006
IEEE
15 years 10 months ago
Specification and Verification of Dynamics in Cognitive Agent Models
Within many domains, among which biological and cognitive areas, multiple interacting processes occur among agents with dynamics that are hard to handle. Current approaches to ana...
Tibor Bosse, Catholijn M. Jonker, Lourens van der ...
PLDI
2006
ACM
15 years 10 months ago
Termination proofs for systems code
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and conte...
Byron Cook, Andreas Podelski, Andrey Rybalchenko