Sciweavers

6201 search results - page 85 / 1241
» Implementation of Axiomatic Language
Sort
View
LOGCOM
2010
120views more  LOGCOM 2010»
14 years 10 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
ICDT
2011
ACM
270views Database» more  ICDT 2011»
14 years 7 months ago
On the equivalence of distributed systems with queries and communication
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
Serge Abiteboul, Balder ten Cate, Yannis Katsis
186
Voted
TOCL
2012
235views Formal Methods» more  TOCL 2012»
13 years 6 months ago
Topological and Simplicial Models of Identity Types
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
Benno van den Berg, Richard Garner
112
Voted
CSFW
2010
IEEE
15 years 8 months ago
On Protection by Layout Randomization
Abstract—Layout randomization is a powerful, popular technique for software protection. We present it and study it in programming-language terms. More specifically, we consider ...
Martín Abadi, Gordon D. Plotkin
HOPL
1993
15 years 8 months ago
The Development of the C Language
The C programming language was devised in the early 1970s as a system implementation language for the nascent Unix operating system. Derived from the typeless language BCPL, it ev...
Dennis Ritchie