Sciweavers

838 search results - page 107 / 168
» From Natural Language to Formal Proof Goal
Sort
View
ICFP
2008
ACM
16 years 6 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
HASKELL
2009
ACM
16 years 20 days ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
TABLEAUX
2005
Springer
15 years 11 months ago
A Tableau-Based Explainer for DL Subsumption
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
Thorsten Liebig, Michael Halfmann
IUI
1993
ACM
15 years 10 months ago
Wizard of Oz studies: why and how
We discuss current approaches to the development of natural language dialogue systems, and claim that they do not sufficiently consider the unique qualities of man-machine intera...
Nils Dahlbäck, Arne Jönsson, Lars Ahrenb...
UML
2005
Springer
15 years 11 months ago
Using Process Algebra to Validate Behavioral Aspects of Object-Oriented Models
We present in this paper a rigorous and automated based approach for the behavioral validation of control software systems. This approach relies on metamodeling, model-transformati...
Alban Rasse, Jean-Marc Perronne, Pierre-Alain Mull...