Sciweavers

275 search results - page 42 / 55
» Non-Termination Inference of Logic Programs
Sort
View
SIGSOFT
2006
ACM
15 years 3 months ago
Bit level types for high level reasoning
Bitwise operations are commonly used in low-level systems code to access multiple data fields that have been packed into a single word. Program analysis tools that reason about s...
Ranjit Jhala, Rupak Majumdar
ICFP
2005
ACM
15 years 9 months ago
Simple, partial type-inference for System F based on type-containment
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
Didier Rémy
ECRA
2002
129views more  ECRA 2002»
14 years 9 months ago
A formal approach to negotiating agents development
This paper presents a formal and executable approach to capture the behaviour of parties involved in a negotiation. A party is modeled as a negotiating agent composed of a communi...
Marlon Dumas, Guido Governatori, Arthur H. M. ter ...
ERLANG
2007
ACM
15 years 1 months ago
A language for specifying type contracts in Erlang and its interaction with success typings
We propose a small extension of the ERLANG language that allows programmers to specify contracts with type information at the level of individual functions. Such contracts are opt...
Miguel Jimenez, Tobias Lindahl, Konstantinos F. Sa...
ICSE
2009
IEEE-ACM
15 years 10 months ago
Discovering and representing systematic code changes
Software engineers often inspect program differences when reviewing others' code changes, when writing check-in comments, or when determining why a program behaves differentl...
Miryung Kim, David Notkin