Sciweavers

99 search results - page 19 / 20
» Some Arguments About Legal Arguments
Sort
View
POPL
2008
ACM
14 years 7 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
ICFP
2005
ACM
14 years 7 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
CICLING
2006
Springer
13 years 11 months ago
Automatic Acquisition of Semantic-Based Question Reformulations for Question Answering
Abstract. In this paper, we present a method for the automatic acquisition of semantic-based reformulations from natural language questions. Our goal is to find useful and generic ...
Jamileh Yousefi, Leila Kosseim
ECTEL
2006
Springer
13 years 11 months ago
Blended Learning Concepts - a Short Overview
This paper presents a short overview of blended learning, showing arguments for and against these concepts. Potential blended learning scenarios are described that vary depending o...
Sonja Trapp
PRESENCE
2006
102views more  PRESENCE 2006»
13 years 7 months ago
The Usability of Collaborative Virtual Environments and Methods for the Analysis of Interaction
This paper describes two methods for analyzing interactions in collaborative virtual environments (CVEs): one whereby quantitative data are captured, interaction is categorized in...
Ralph Schroeder, Ilona Heldal, Jolanda G. Tromp