Sciweavers

73 search results - page 5 / 15
» Reasoning about Implicit Invocation
Sort
View
ICCAD
2002
IEEE
124views Hardware» more  ICCAD 2002»
15 years 6 months ago
Symbolic pointer analysis
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
Jianwen Zhu
CONCUR
2000
Springer
15 years 1 months ago
An Implicitly-Typed Deadlock-Free Process Calculus
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
Naoki Kobayashi, Shin Saito, Eijiro Sumii
90
Voted
GEOS
2009
Springer
15 years 2 months ago
Towards Reasoning Pragmatics
Abstract. The realization of Semantic Web reasoning is central to substantiating the Semantic Web vision. However, current mainstream research on this topic faces serious challenge...
Pascal Hitzler
72
Voted
TPHOL
2007
IEEE
15 years 3 months ago
Formalising Generalised Substitutions
Abstract. We use the theorem prover Isabelle to formalise and machinecheck results of the theory of generalised substitutions given by Dunne and used in the B method. We describe t...
Jeremy E. Dawson
PERCOM
2004
ACM
15 years 9 months ago
Ontology Based Context Modeling and Reasoning using OWL
In this paper we propose an OWL encoded context ontology (CONON) for modeling context in pervasive computing environments, and for supporting logicbased context reasoning. CONON p...
Xiaohang Wang, Daqing Zhang, Tao Gu, Hung Keng Pun...