Sciweavers

303 search results - page 28 / 61
» A formal executable semantics of Verilog
Sort
View
114
Voted
IPL
2007
78views more  IPL 2007»
15 years 3 months ago
Ensuring the quasi-termination of needed narrowing computations
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
135
Voted
ESOP
2010
Springer
16 years 1 months ago
Verifying a Compiler for Java Threads
Abstract. A verified compiler is an integral part of every security infrastructure. Previous work has come up with formal semantics for sequential and concurrent variants of Java a...
Andreas Lochbihler
152
Voted
ESWS
2007
Springer
15 years 9 months ago
Two-Phase Web Service Discovery Based on Rich Functional Descriptions
Discovery is a central reasoning task in service-oriented architectures, concerned with detecting Web services that are usable for solving a given request. This paper presents two ...
Michael Stollberg, Uwe Keller, Holger Lausen, Stij...
227
Voted
ICDE
2001
IEEE
159views Database» more  ICDE 2001»
16 years 5 months ago
Workflow and Process Synchronization with Interaction Expressions and Graphs
Current workflow management technology does not provide adequate means for inter-workflow coordination as concurrently executing workflows are considered completely independent. W...
Christian Heinlein
144
Voted
FMCAD
2004
Springer
15 years 9 months ago
Proof Styles in Operational Semantics
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
Sandip Ray, J. Strother Moore