2398 search results - page 277 / 480 » Constraint Programming and Graph Algorithms |
171
click to vote
ISNN
2005
Springer
15 years 12 months ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
208
click to vote
AMAST
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
146
click to vote
SWAT
1998
Springer
15 years 10 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
140
click to vote
ICSE
1995
IEEE-ACM
15 years 10 months ago
1995
IEEE-ACM
Compilers and other programming environment tools derive information from the source code of programs; derived information includes compiled code, interprocedural summary informat...
154
Voted
ESSOS
2010
Springer
16 years 3 months ago
2010
Springer
Information flow control systems provide the guarantees that are required in today’s security-relevant systems. While the literature has produced a wealth of techniques to ensur...