Sciweavers

1638 search results - page 203 / 328
» A General Semantics for Evaluation Logic
Sort
View
POPL
2010
ACM
16 years 3 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
SAC
2010
ACM
16 years 1 months ago
Dual analysis for proving safety and finding bugs
Program bugs remain a major challenge for software developers and various tools have been proposed to help with their localization and elimination. Most present-day tools are base...
Corneliu Popeea, Wei-Ngan Chin
CAV
2007
Springer
113views Hardware» more  CAV 2007»
16 years 19 days ago
Three-Valued Abstraction for Continuous-Time Markov Chains
lued Abstraction for Continuous-Time Markov Chains⋆ Joost-Pieter Katoen1 , Daniel Klink1 , Martin Leucker2 , and Verena Wolf3 RWTH Aachen University1 , TU Munich2 , University of...
Joost-Pieter Katoen, Daniel Klink, Martin Leucker,...
CAISE
2004
Springer
15 years 12 months ago
Information Modeling and Higher-order Types
: While some information modeling approaches (e.g. the Relational Model, and Object-Role Modeling) are typically formalized using first-order logic, other approaches to information...
Terry A. Halpin
EKAW
2004
Springer
15 years 12 months ago
Managing Patient Record Instances Using DL-Enabled Formal Concept Analysis
Abstract In this paper we describe a general logic-enabled Formal Concept Analysis (FCA) approach to manage patient record instances. In particular, the conceptual model of the dom...
Bo Hu, Srinandan Dasmahapatra, David Dupplaw, Paul...