Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-8
|
Results: 8
Symbolic model checking with rich assertional languages
Authors:
Kesten, Y Maler, O Marcus, M Pnueli, A Shahar, E
Citation:
Y. Kesten et al., Symbolic model checking with rich assertional languages, THEOR COMP, 256(1-2), 2001, pp. 93-112
Scheduling time-constrained instructions on pipelined processors
Authors:
Leung, A Palem, KV Pnueli, A
Citation:
A. Leung et al., Scheduling time-constrained instructions on pipelined processors, ACM T PROGR, 23(1), 2001, pp. 73-103
Verification by augmented abstraction: The automata-theoretic view
Authors:
Kesten, Y Pnueli, A Vardi, MY
Citation:
Y. Kesten et al., Verification by augmented abstraction: The automata-theoretic view, J COMPUT SY, 62(4), 2001, pp. 668-690
Verification by augmented finitary abstraction
Authors:
Kesten, Y Pnueli, A
Citation:
Y. Kesten et A. Pnueli, Verification by augmented finitary abstraction, INF COMPUT, 163(1), 2000, pp. 203-243
Effective synthesis of switching controllers for linear systems
Authors:
Asarin, E Bournez, O Dang, T Maler, O Pnueli, A
Citation:
E. Asarin et al., Effective synthesis of switching controllers for linear systems, P IEEE, 88(7), 2000, pp. 1011-1025
Verification of clocked and hybrid systems
Authors:
Kesten, Y Manna, Z Pnueli, A
Citation:
Y. Kesten et al., Verification of clocked and hybrid systems, ACT INFORM, 36(11), 2000, pp. 837-912
Decidable integration graphs
Authors:
Kesten, Y Pnueli, A Sifakis, J Yovine, S
Citation:
Y. Kesten et al., Decidable integration graphs, INF COMPUT, 150(2), 1999, pp. 209-243
Proving refinement using transduction
Authors:
Jonsson, B Pnueli, A Rump, C
Citation:
B. Jonsson et al., Proving refinement using transduction, DIST COMPUT, 12(2-3), 1999, pp. 129-149
Risultati:
1-8
|