• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 2,618
Next 10 →

Reasoning about pointers in refinement calculus

by Ralph-johan Back - In 10th Asia-Pacific Software Engineering Conference (APSEC'03 , 2003
"... Pointers are an important programming concept. They are used explicitely or implicitly in many programming languages. In particular, the semantics of object-oriented programming languages rely on pointers. We introduce a semantics for pointer structures. Pointers are seen as indexes and pointer fiel ..."
Abstract - Cited by 11 (2 self) - Add to MetaCart
fields are functions from these indexes to values. Using this semantics we turn all pointer operations into simple assignments and then we use refinement calculus techniques to construct a pointer-manipulating program that checks whether or not a single linked list has a loop. We also introduce

GOLOG: A Logic Programming Language for Dynamic Domains

by Hector J. Levesque, Raymond Reiter, Yves Lespérance, Fangzhen Lin, Richard B. Scherl , 1994
"... This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world. This allo ..."
Abstract - Cited by 628 (74 self) - Add to MetaCart
. This allows programs to reason about the state of the world and consider the effects of various possible courses of action before committing to a particular behavior. The net effect is that programs may be written at a much higher level of abstraction than is usually possible. The language appears well suited

Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,

by ] Richard Hackman , Grec R Oldham , 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract - Cited by 622 (2 self) - Add to MetaCart
in the management literature, in fact little is known about the reasons why "enriched" work sometimes leads to positive outcomes for workers and for their employing organizations. Even less is known about the relative effectiveness of various strategies for carrying out the redesign of work One reason

Knowledge Interchange Format Version 3.0 Reference Manual

by Michael Genesereth, Richard E. Fikes, Ronald Brachman, Thomas Gruber, Patrick Hayes, Reed Letsinger, Vladimir Lifschitz, Robert Macgregor, John Mccarthy, Peter Norvig, Ramesh Patil , 1992
"... : Knowledge Interchange Format (KIF) is a computer-oriented language for the interchange of knowledge among disparate programs. It has declarative semantics (i.e. the meaning of expressions in the representation can be understood without appeal to an interpreter for manipulating those expressions); ..."
Abstract - Cited by 484 (14 self) - Add to MetaCart
); it is logically comprehensive (i.e. it provides for the expression of arbitrary sentences in the first-order predicate calculus); it provides for the representation of knowledge about the representation of knowledge; it provides for the representation of nonmonotonic reasoning rules; and it provides

Mobile Values, New Names, and Secure Communication

by Martín Abadi, Cédric Fournet , 2001
"... We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are the main motivating examples for our work; it also appears in other programming-language contexts. Specifically, we intro ..."
Abstract - Cited by 372 (17 self) - Add to MetaCart
introduce a simple, general extension of the pi calculus with value passing, primitive functions, and equations among terms. We develop semantics and proof techniques for this extended language and apply them in reasoning about some security protocols.

EXE: Automatically generating inputs of death

by Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, David L. Dill, Dawson R. Engler - In Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS , 2006
"... This article presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input, EXE runs it on symbolic input initially allowed to be anything. As checked code runs, EXE tracks the constraints on ea ..."
Abstract - Cited by 349 (21 self) - Add to MetaCart
on the true branch and false on the other. Because EXE reasons about all possible values on a path, it has much more power than a traditional runtime tool: (1) it can force execution down any feasible program path and (2) at dangerous operations (e.g., a pointer dereference), it detects if the current path

Reasoning about Pointer Structures in Java

by Kurt Stenzel, Holger Grandy, Wolfgang Reif , 2006
"... Java programs often use pointer structures for normal computations. A verification system for Java should have good proof support for reasoning about those structures. However, the literature for pointer verification almost always uses specifications and definitions that are tailored to the problem ..."
Abstract - Add to MetaCart
Java programs often use pointer structures for normal computations. A verification system for Java should have good proof support for reasoning about those structures. However, the literature for pointer verification almost always uses specifications and definitions that are tailored to the problem

On Data Refinement in the Presence of Pointers ∗

by Ivana Filipović, Queen Mary, Queen Mary, Hongseok Yang, Queen Mary, Noah Torp-smith , 2008
"... Data refinement is a common approach to reasoning about programs, based on establishing pattern. Reasoning about programs in this setting becomes complex when use of pointers is assumed and, moreover, a well-known method for proving data refinement, namely the forward simulation method, becomes unso ..."
Abstract - Add to MetaCart
Data refinement is a common approach to reasoning about programs, based on establishing pattern. Reasoning about programs in this setting becomes complex when use of pointers is assumed and, moreover, a well-known method for proving data refinement, namely the forward simulation method, becomes

The Revised Report on the Syntactic Theories of Sequential Control and State

by Matthias Felleisen, Robert Hieb - THEORETICAL COMPUTER SCIENCE , 1992
"... The syntactic theories of control and state are conservative extensions of the v -calculus for equational reasoning about imperative programming facilities in higher-order languages. Unlike the simple v -calculus, the extended theories are mixtures of equivalence relations and compatible congruen ..."
Abstract - Cited by 292 (36 self) - Add to MetaCart
The syntactic theories of control and state are conservative extensions of the v -calculus for equational reasoning about imperative programming facilities in higher-order languages. Unlike the simple v -calculus, the extended theories are mixtures of equivalence relations and compatible

Risk as analysis and risk as feelings: Some thoughts about affect, reason, risk, and rationality

by Paul Slovic, Melissa L. Finucane, Ellen Peters, Donald G. Macgregor - Risk Analysis , 2004
"... Modern theories in cognitive psychology and neuroscience indicate that there are two fundamental ways in which human beings comprehend risk. The “analytic system ” uses algorithms and normative rules, such as the probability calculus, formal logic, and risk assessment. It is relatively slow, effortf ..."
Abstract - Cited by 234 (12 self) - Add to MetaCart
Modern theories in cognitive psychology and neuroscience indicate that there are two fundamental ways in which human beings comprehend risk. The “analytic system ” uses algorithms and normative rules, such as the probability calculus, formal logic, and risk assessment. It is relatively slow
Next 10 →
Results 1 - 10 of 2,618
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University