Sciweavers

1076 search results - page 76 / 216
» Operations on proofs and labels
Sort
View
FMOODS
2008
13 years 10 months ago
Semantic Foundations and Inference of Non-null Annotations
This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a mini...
Laurent Hubert, Thomas P. Jensen, David Pichardie
FBT
2000
167views Formal Methods» more  FBT 2000»
13 years 10 months ago
Diagrams for Dataflow
The behavior of reactive systems can be described by their black box properties as a relation between input and output streams. More operational is the behavior's description...
Max Breitling, Jan Philipps
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
ENTCS
2008
102views more  ENTCS 2008»
13 years 9 months ago
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This p...
Alexander Kurz, Daniela Petrisan
ENTCS
2006
189views more  ENTCS 2006»
13 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