Result 1 to 20 of 50 total
Special issue: Games, Automata, logic, and formal verification (GandALF 2010). Selected papers based on the presentations at the 1st symposium, Minori, Itay, June 17‒18, 2010. (English)
Int. J. Found. Comput. Sci. 23, No. 3, 555-711 (2012).
1
Robust unmixing of hyperspectral images: application to Mars (English)
IGARSS, 1291-1294 (2011).
2
Graded CTL model checking for test generation (English)
SpringSim (TMS-DEVS), 59-66 (2011).
3
Graded alternating-time temporal logic. (English)
Fundam. Inform. 105, No. 1-2, 189-210 (2010).
4
Graded alternating-time temporal logic. (English)
Clarke, Edmund M. (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 16th international conference, LPAR-16, Dakar, Senegal, April 25 ‒ May 1, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-17510-7/pbk). Lecture Notes in Computer Science 6355. Lecture Notes in Artificial Intelligence, 192-211 (2010).
5
A NuSMV extension for graded-CTL model checking. (English)
Touili, Tayssir (ed.) et al., Computer aided verification. 22nd international conference, CAV 2010, Edinburgh, UK, July 15‒19, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14294-9/pbk). Lecture Notes in Computer Science 6174, 670-673 (2010).
6
Proceedings first symposium on games, automata, logic, and formal verification. (English)
Comput. Res. Repos. 2010, Article No. 1006.1711 (2010).
7
End-to-end simulation and analytical model of remote-sensing systems: application to CRISM (English)
IEEE T. Geoscience and Remote Sensing 48, No. 11, 3877-3888 (2010).
8
Graded alternating-time temporal logic (English)
LPAR (Dakar), 192-211 (2010).
9
A nusmv extension for graded-CTL model checking (English)
CAV, 670-673 (2010).
10
Model checking for graded CTL. (English)
Fundam. Inform. 96, No. 3, 323-339 (2009).
11
Graded-CTL: Satisfiability and symbolic model checking. (English)
Breitman, Karin (ed.) et al., Formal methods and software engineering. 11th international conference on formal engineering methods, ICFEM 2009, Rio de Janeiro, Brazil, December 9‒12, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10372-8/pbk). Lecture Notes in Computer Science 5885, 306-325 (2009).
12
Graded-CTL: satisfiability and symbolic model checking (English)
ICFEM, 306-325 (2009).
13
Program complexity in hierarchical module checking. (English)
Cervesato, Iliano (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 15th international conference, LPAR 2008, Doha, Qatar, November 22‒27, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-89438-4/pbk). Lecture Notes in Computer Science 5330. Lecture Notes in Artificial Intelligence, 318-332 (2008).
14
Enriched MU-calculi module checking. (English)
Comput. Res. Repos. 2008, Article No. 0805.3462 (2008).
15
CTL model-checking with graded quantifiers. (English)
Cha, Sungdeok (Steve) (ed.) et al., Automated technology for verification and analysis. 6th international symposium, ATVA 2008, Seoul, Korea, October 20‒23, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-88386-9/pbk). Lecture Notes in Computer Science 5311, 18-32 (2008).
16
Enriched $μ$-calculi module checking. (English)
Log. Methods Comput. Sci. 4, No. 3, Paper 1, 21 p., electronic only (2008).
17
Verification of scope-dependent hierarchical state machines. (English)
Inf. Comput. 206, No. 9-10, 1161-1177 (2008).
18
Mixed Nash equilibria in selfish routing problems with dynamic constraints. (English)
Theor. Comput. Sci. 393, No. 1-3, 37-53 (2008).
19
Program complexity in hierarchical module checking (English)
LPAR, 318-332 (2008).
20
Result 1 to 20 of 50 total