Sciweavers

4257 search results - page 338 / 852
» The Logical Modularity of Programs
Sort
View
ICCS
2005
Springer
16 years 5 days ago
A Logarithmic Time Method for Two's Complementation
This paper proposes an innovative algorithm to find the two’s complement of a binary number. The proposed method works in logarithmic time (O(logN)) instead of the worst case li...
Jung-Yup Kang, Jean-Luc Gaudiot
VL
2002
IEEE
105views Visual Languages» more  VL 2002»
15 years 11 months ago
A Visual Framework for Modelling with Heterogeneous Notations
There is a range of modelling notations, both textual and diagrammatic, whose semantics are based on first-order predicate logic. This paper presents a visual framework for organ...
Jean Flower, John Howse, John Taylor, Stuart Kent
182
Voted
LPAR
2010
Springer
15 years 5 months ago
Labelled Unit Superposition Calculi for Instantiation-Based Reasoning
The Inst-Gen-Eq method is an instantiation-based calculus which is complete for first-order clause logic modulo equality. Its distinctive feature is that it combines first-order ...
Konstantin Korovin, Christoph Sticksel
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 10 months ago
A Foundational View on Integration Problems
The integration of reasoning and computation services across system and language boundaries has been mostly treated from an engineering perspective. In this paper we take a foundat...
Florian Rabe, Michael Kohlhase, Claudio Sacerdoti ...
POPL
2005
ACM
16 years 7 months ago
Permission accounting in separation logic
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...
Richard Bornat, Cristiano Calcagno, Peter W. O'Hea...