Sciweavers

1818 search results - page 91 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
ICGI
2010
Springer
13 years 10 months ago
Inferring Regular Trace Languages from Positive and Negative Samples
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
Antonio Cano Gómez
IGPL
2008
93views more  IGPL 2008»
13 years 9 months ago
Cut-Based Abduction
In this paper we explore a generalization of traditional abduction which can simultaneously perform two different tasks: (i) given an unprovable sequent G, find a sentence H such ...
Marcello D'Agostino, Marcelo Finger, Dov M. Gabbay
TAP
2008
Springer
153views Hardware» more  TAP 2008»
13 years 8 months ago
Bounded Relational Analysis of Free Data Types
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
TCS
2008
13 years 8 months ago
Integration of a security type system into a program logic
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...
Reiner Hähnle, Jing Pan, Philipp Rümmer,...
CG
2004
Springer
13 years 8 months ago
Recursive turtle programs and iterated affine transformations
We provide a formal proof of equivalence between the class of fractals created by Recursive Turtle Programs (RTP) and Iterated Affine Transformations (IAT). We begin by reviewing ...
Tao Ju, Scott Schaefer, Ron Goldman