Sciweavers

13383 search results - page 221 / 2677
» Abstractions from proofs
Sort
View
CADE
2001
Springer
16 years 7 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
CORR
2010
Springer
208views Education» more  CORR 2010»
15 years 6 months ago
Bounded Model Checking of Multi-threaded Software using SMT solvers
The transition from single-core to multi-core processors has made multi-threaded software an important subject in computer aided verification. Here, we describe and evaluate an ex...
Lucas Cordeiro, Bernd Fischer 0002
ICISS
2009
Springer
15 years 11 months ago
A Generic Distortion Free Watermarking Technique for Relational Databases
In this paper we introduce a distortion free watermarking e for relational databases based on the Abstract Interpretation framework. The watermarking technique is partition based. ...
Sukriti Bhattacharya, Agostino Cortesi
DAGSTUHL
2003
15 years 8 months ago
Organising Computation through Dynamic Grouping
Abstract. There are a range of abstractions used for both modelling and proof modern computational systems. While these abstractions may have been devised for specific purposes, t...
Michael Fisher, Chiara Ghidini, Benjamin Hirsch
IJFCS
2011
78views more  IJFCS 2011»
15 years 1 months ago
P Systems and Topology: Some Suggestions for Research
some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to pology. In turn, the ...
Pierluigi Frisco, Hendrik Jan Hoogeboom