Sciweavers

2137 search results - page 32 / 428
» Proving Abstract Non-interference
Sort
View
ESOP
2011
Springer
14 years 1 months ago
General Bindings and Alpha-Equivalence in Nominal Isabelle
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...
Christian Urban, Cezary Kaliszyk
PADL
2011
Springer
14 years 23 days ago
Plato: A Compiler for Interactive Web Forms
Abstract. Modern web forms interact with the user in real-time by detecting errors and filling-in implied values, which in terms of automated reasoning amounts to SAT solving and ...
Timothy L. Hinrichs
WINE
2010
Springer
189views Economy» more  WINE 2010»
14 years 7 months ago
The Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy Bounds
Abstract. We show a formal duality between certain equilibrium concepts, including the correlated and coarse correlated equilibrium, and analysis frameworks for proving bounds on t...
Uri Nadav, Tim Roughgarden
ENTCS
2010
130views more  ENTCS 2010»
14 years 7 months ago
Structural Operational Semantics and Modal Logic, Revisited
A previously introduced combination of the bialgebraic approach to structural operational semantics with aic modal logic is re-examined and improved in some aspects. Firstly, a mo...
Bartek Klin
CORR
2011
Springer
171views Education» more  CORR 2011»
14 years 5 months ago
A Class of Probabilistic Automata with a Decidable Value 1 Problem
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...
Nathanaël Fijalkow, Hugo Gimbert, Youssouf Ou...