Sciweavers

Share
ENTCS
2006
169views more  ENTCS 2006»
9 years 9 months ago
Constructing Induction Rules for Deductive Synthesis Proofs
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques D. Fl...
ENTCS
2006
131views more  ENTCS 2006»
9 years 9 months ago
Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names
Mikkel Bundgaard, Thomas T. Hildebrandt
ENTCS
2006
89views more  ENTCS 2006»
9 years 9 months ago
A Type-theoretic Reconstruction of the Visitor Pattern
In object-oriented languages, the Visitor pattern can be used to traverse tree-like data structures: a visitor object contains some operations, and the data structure objects allo...
Peter Buchlovsky, Hayo Thielecke
ENTCS
2006
189views more  ENTCS 2006»
9 years 9 months ago
Variables as Resource for Shared-Memory Programs: Semantics and Soundness
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
Stephen D. Brookes
ENTCS
2006
151views more  ENTCS 2006»
9 years 9 months ago
Stochastic Simulation Methods Applied to a Secure Electronic Voting Model
We demonstrate a novel simulation technique for analysing large stochastic process algebra models, applying this to a secure electronic voting system example. By approximating the...
Jeremy T. Bradley, Stephen T. Gilmore
ENTCS
2006
129views more  ENTCS 2006»
9 years 9 months ago
From Coalition Logic to STIT
Jan Broersen, Andreas Herzig, Nicolas Troquard
ENTCS
2006
96views more  ENTCS 2006»
9 years 9 months ago
Weighted Timed Automata: Model-Checking and Games
In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model. Key words: Weighted/pri...
Patricia Bouyer
ENTCS
2006
153views more  ENTCS 2006»
9 years 9 months ago
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
Lars Birkedal, Rasmus Ejlers Møgelberg, Ras...
ENTCS
2006
104views more  ENTCS 2006»
9 years 9 months ago
Using Bytecode Instruction Counting as Portable CPU Consumption Metric
Accounting for the CPU consumption of applications is crucial for software development to detect and remove performance bottlenecks (profiling) and to evaluate the performance of ...
Walter Binder, Jarle Hulaas
books