Sciweavers

635 search results - page 102 / 127
» Towards the formalization of interaction semantics
Sort
View
ICFP
2005
ACM
15 years 9 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
MICS
2010
81views more  MICS 2010»
14 years 8 months ago
Tactics for Hierarchical Proof
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
David Aspinall, Ewen Denney, Christoph Lüth
TNN
1998
125views more  TNN 1998»
14 years 9 months ago
Symbolic connectionism in natural language disambiguation
Abstract—Natural language understanding involves the simultaneous consideration of a large number of different sources of information. Traditional methods employed in language an...
Samuel W. K. Chan, James Franklin
106
Voted
SCP
1998
163views more  SCP 1998»
14 years 9 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
WWW
2001
ACM
15 years 10 months ago
A unified constraint model for XML
Integrity constraints are an essential part of a modern schema definition language. They are useful for semantic specification, update consistency control, query optimization, inf...
Gabriel M. Kuper, Jérôme Siméo...