Sciweavers

1210 search results - page 32 / 242
» Formal Techniques for Java Programs
Sort
View
SAC
2006
ACM
15 years 8 months ago
Union types for object-oriented programming
We propose union types for statically typed class-based objectoriented languages as a means to enhance the flexibility of subtyping. As its name suggests, a union type can be con...
Atsushi Igarashi, Hideshi Nagira
SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
15 years 6 months ago
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
Frédéric Mesnard, Ulrich Neumerkel
IPPS
2003
IEEE
15 years 7 months ago
Model Checking a Cache Coherence Protocol for a Java DSM Implementation
Jackal is a fine-grained distributed shared memory implementation of the Java programming language. It aims to implement Java’s memory model and allows multithreaded Java progr...
Jun Pang, Wan Fokkink, Rutger F. H. Hofman, Ronald...
ICFP
1999
ACM
15 years 6 months ago
Principals in Programming Languages: A Syntactic Proof Technique
Programs are often structured around the idea that different pieces of code comprise distinct principals, each with a view of its environment. Typical examples include the module...
Steve Zdancewic, Dan Grossman, J. Gregory Morriset...
121
Voted
ICSE
1999
IEEE-ACM
15 years 6 months ago
Data Flow Analysis for Checking Properties of Concurrent Java Programs
In this paper we show how the FLAVERS data flow analysis technique, originally formulated for programs with the rendezvous model of concurrency, can be applied to concurrent Java...
Gleb Naumovich, George S. Avrunin, Lori A. Clarke