K. Bsaïes - Citegraph

Author Info

Name	Affiliation	Papers
K. BSAÏES	Faculté des Sciences de Tunis DSI, Campus Universitaire, 2092 Tunis, Tunisia	31
Collaborators	Citations	PageRank
27	45	12.46
Referers	Referees	References
68	356	263

Search Limit

100356

Publications (31 rows)

Collaborators (27 rows)

Referers (68 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
New method of registration based on the theory of possibility	0	0.34	2018
A Causal Semantics for UML2.0 Sequence Diagrams with Nested Combined Fragments.	0	0.34	2017
Refinement Of Uml2.0 Sequence Diagrams For Distributed Systems	0	0.34	2016
Extending causal semantics of UML2.0 sequence diagram for distributed systems	0	0.34	2015
Verifying while loops with invariant relations	4	0.45	2014
Rocchio Algorithm to Enhance Semantically Collaborative Filtering.	0	0.34	2014
User Semantic Model for Dependent Attributes to Enhance Collaborative Filtering.	0	0.34	2014
Invariant functions and invariant relations: An alternative to invariant assertions	4	0.39	2013
A versatile concept for the analysis of loops.	5	0.40	2012
User Semantic Preferences for Collaborative Recommendations.	3	0.40	2012
Computing preconditions and postconditions of while loops	9	0.53	2011
Reasoning About Quantitative Architectural Attributes (Invited Paper).	0	0.34	2011
Relational Methods in the Analysis of While Loops: Observations of Versatility	0	0.34	2009
Appropriate lemmae discovery	0	0.34	2004
Correction de conjectures fausses par synthèse de programmes.	0	0.34	2003
Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures	0	0.34	2003
Découverte de lemmes par instanciation de métavariables dans les preuves par récurrence	0	0.34	2002
Unfold/fold inductive proof: an extension of a folding technique	0	0.34	1999
May reasoning be reduced to an information retrieval problem?	3	0.75	1998
A methodology for constructing logic programs	1	0.37	1997
Mechanizing Proofs by Unfolding, Folding and Simplification	0	0.34	1997
Discovering and proving logic program properties	0	0.34	1995
Discovering "Eureka Steps" in Transforming Logic Programs	0	0.34	1994
Transformation of generate and test logic programs	0	0.34	1994
Implementing the Synthesis of Properties in Unfold/Fold Transformations	0	0.34	1994
Automated derivation of efficient logic programs by synthesizing eureka properties	1	0.39	1993
A strategy for transforming generate and test logic programs	0	0.34	1992
Spes: A System for Logic Program Transformation	7	0.76	1992
Static Analysis for the Synthesis of Eureka Properties for Transforming Logic Programs	2	0.52	1992
A Framework for Mechanizing Logic Program Transformation: The Synthesis of Eureka-Properties	0	0.34	1992
On Using Mode Input-output for Transforming Logic Programs	6	0.74	1991