Sciweavers

MFCS
1998
Springer
13 years 12 months ago
Flow Logic for Imperative Objects
We develop a control flow analysis for the Imperative Object Calculus. We prove the correctness with respect to two Structural Operational Semantics that differ in minor technical ...
Flemming Nielson, Hanne Riis Nielson
MFCS
1998
Springer
13 years 12 months ago
Timed Bisimulation and Open Maps
Thomas Hune, Mogens Nielsen
MFCS
1998
Springer
13 years 12 months ago
Spatial and Temporal Refinement of Typed Graph Transformation Systems
Martin Große-Rhode, Francesco Parisi-Presicc...
MFCS
1998
Springer
13 years 12 months ago
Tally NP Sets and Easy Census Functions
Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe
MFCS
1998
Springer
13 years 12 months ago
Facial Circuits of Planar Graphs and Context-Free Languages
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
Bruno Courcelle, Denis Lapoire
MFCS
1998
Springer
13 years 12 months ago
Defining the Java Virtual Machine as Platform for Provably Correct Java Compilation
Abstract. We provide concise abstract code for running the Java Virtual Machine (JVM) to execute compiled Java programs, and define a general compilation scheme of Java programs to...
Egon Börger, Wolfram Schulte
MFCS
1998
Springer
13 years 12 months ago
Embedding of Hypercubes into Grids
Sergei L. Bezrukov, Joe D. Chavez, L. H. Harper, M...
MFCS
1998
Springer
13 years 12 months ago
Minimum Propositional Proof Length is NP-Hard to Linearly Approximate
Michael Alekhnovich, Samuel R. Buss, Shlomo Moran,...
FOCS
1997
IEEE
13 years 12 months ago
Making Nondeterminism Unambiguous
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of pr...
Klaus Reinhardt, Eric Allender