Sciweavers

9626 search results - page 1342 / 1926
» Invariant Based Programming
Sort
View
STOC
2004
ACM
109views Algorithms» more  STOC 2004»
16 years 7 months ago
Approximating the cut-norm via Grothendieck's inequality
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
Noga Alon, Assaf Naor
ICALP
2009
Springer
16 years 7 months ago
Approximating Markov Processes by Averaging
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...
Philippe Chaput, Vincent Danos, Prakash Panangaden...
EDBT
2008
ACM
141views Database» more  EDBT 2008»
16 years 7 months ago
Generating Highly Customizable SQL Parsers
Database technology and the Structured Query Language (SQL) have grown enormously in recent years. Applications from different domains have different requirements for using databa...
Gunter Saake, Marko Rosenmüller, Martin Kuhle...
ICSE
2004
IEEE-ACM
16 years 7 months ago
Mining Version Histories to Guide Software Changes
We apply data mining to version histories in order to guide programmers along related changes: "Programmers who changed these functions also changed...." Given a set of e...
Andreas Zeller, Peter Weißgerber, Stephan Di...
ICSE
2004
IEEE-ACM
16 years 7 months ago
Runtime Verification of Statechart Implementations
Our paper introduces a runtime verification framework for concurrent monitoring of applications specified by UML statecharts. The approach offers a considerable degree of granulari...
Gergely Pintér, István Majzik
« Prev « First page 1342 / 1926 Last » Next »