Result 1 to 20 of 309 total
Termination detection for active objects. (English)
J. Log. Algebr. Program. 81, No. 4, 541-557 (2012).
1
Static analysis of IMC. (English)
J. Log. Algebr. Program. 81, No. 4, 522-540 (2012).
2
A relational realizability model for higher-order stateful ADTs. (English)
J. Log. Algebr. Program. 81, No. 4, 491-521 (2012).
3
A dynamic deontic logic for complex contracts. (English)
J. Log. Algebr. Program. 81, No. 4, 458-490 (2012).
4
A formal approach to the specification and transformation of constraints in MDE. (English)
J. Log. Algebr. Program. 81, No. 4, 422-457 (2012).
5
Modal transition systems with weight intervals. (English)
J. Log. Algebr. Program. 81, No. 4, 408-421 (2012).
6
Automated debugging based on a constraint model of the program and a test case. (English)
J. Log. Algebr. Program. 81, No. 4, 390-407 (2012).
7
Three-valued abstraction for probabilistic systems. (English)
J. Log. Algebr. Program. 81, No. 4, 356-389 (2012).
8
Deadlock checking by a behavioral effect system for lock handling. (English)
J. Log. Algebr. Program. 81, No. 3, 331-354 (2012).
9
Reverse universal resolving algorithm and inverse driving. (English)
J. Log. Algebr. Program. 81, No. 3, 314-330 (2012).
10
Reachability analysis for timed automata using max-plus algebra. (English)
J. Log. Algebr. Program. 81, No. 3, 298-313 (2012).
11
Formal modeling and validation of a power-efficient grouping protocol for WSNs. (English)
J. Log. Algebr. Program. 81, No. 3, 284-297 (2012).
12
Safe locking for multi-threaded Java with exceptions. (English)
J. Log. Algebr. Program. 81, No. 3, 257-283 (2012).
13
Observable behavior of distributed systems: component reasoning for concurrent objects. (English)
J. Log. Algebr. Program. 81, No. 3, 227-256 (2012).
14
Consistency and refinement for interval Markov chains. (English)
J. Log. Algebr. Program. 81, No. 3, 209-226 (2012).
15
Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control. (English)
J. Log. Algebr. Program. 81, No. 3, 181-208 (2012).
16
Computing strong and weak bisimulations for psi-calculi. (English)
J. Log. Algebr. Program. 81, No. 3, 162-180 (2012).
17
A versatile concept for the analysis of loops. (English)
J. Log. Algebr. Program. 81, No. 5, 606-622 (2012).
18
On the analysis of compensation correctness. (English)
J. Log. Algebr. Program. 81, No. 5, 585-605 (2012).
19
Semantics of structured normal logic programs. (English)
J. Log. Algebr. Program. 81, No. 5, 559-584 (2012).
20
Result 1 to 20 of 309 total
Start
Contact
Print
General Help
