Sciweavers

69 search results - page 13 / 14
» Characterizing strong normalization in a language with contr...
Sort
View
JACM
2000
81views more  JACM 2000»
15 years 4 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
HICSS
2012
IEEE
324views Biometrics» more  HICSS 2012»
14 years 21 days ago
Extending BPMN for Business Activity Monitoring
—Real-time access to key performance indicators is necessary to ensure timeliness and effectiveness of operational business processes. The concept of Business Activity Monitoring...
Jan-Philipp Friedenstab, Christian Janiesch, Marti...
149
Voted
APLAS
2006
ACM
15 years 11 months ago
A Bytecode Logic for JML and Types
This document contains the Isabelle/HOL sources underlying our paper A bytecode logic for JML and types [2], updated to Isabelle 2008. We present a program logic for a subset of s...
Lennart Beringer, Martin Hofmann
CL
2008
Springer
15 years 5 months ago
Efficient exception handling in Java bytecode-to-C ahead-of-time compiler for embedded systems
One of the most promising approaches to Java acceleration in embedded systems is a bytecode-to-C ahead-of-time compiler (AOTC). It improves the performance of a Java virtual machi...
Dong-Heon Jung, Jong Kuk Park, Sung-Hwan Bae, Jaem...
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 9 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund